Input TRS:
    1: *(*(x,y),z) -> *(x,*(y,z))
    2: *(+(x,y),z) -> +(*(x,z),*(y,z))
    3: *(x,+(y,f(z))) -> *(g(x,z),+(y,y))
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #*(+(x,y),z) -> #*(x,z)
   #2: #*(+(x,y),z) -> #*(y,z)
   #3: #*(x,+(y,f(z))) -> #*(g(x,z),+(y,y))
   #4: #*(*(x,y),z) -> #*(x,*(y,z))
   #5: #*(*(x,y),z) -> #*(y,z)
Number of SCCs: 2, DPs: 5, edges: 17
	SCC { #3 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  found.
  #*(x,+(f(z_{1}),f(z)))	-#3->
  #*(g(x,z),+(f(z_{1}),f(z_{1})))	--->*
  #*(g(x,z),+(f(z_{1}),f(z_{1})))
  Looping with: [ z := z_{1}; x := g(x,z); z_{1} := z_{1}; ]
NO