Input TRS:
    1: h(f(f(x))) -> h(f(g(f(x))))
    2: f(g(f(x))) -> f(f(x))
Number of strict rules: 2
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(g(f(x))) -> #f(f(x))
   #2: #h(f(f(x))) -> #h(f(g(f(x))))
   #3: #h(f(f(x))) -> #f(g(f(x)))
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #2 }
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.
  #h(f(f(x_{1})))	-#2->
  #h(f(g(f(x_{1}))))	--->*
  #h(f(f(x_{1})))
  Looping with: [ x_{1} := x_{1}; ]
NO