Input TRS:
    1: f(x) -> g(f(x))
    2: g(f(x)) -> x
    3: g(x) -> a()
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... removes: 2
     a()	weight: 0
     f(x1)	weight: (/ 1 4) + x1
     g(x1)	weight: x1
Number of strict rules: 2
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(x) -> #g(f(x))
   #2: #f(x) -> #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.
  #f(x_{1})	-#2->
  #f(x_{1})	--->*
  #f(x_{1})
  Looping with: [ x_{1} := x_{1}; ]
NO