Input TRS:
    1: f(X) -> g(n__h(f(X)))
    2: h(X) -> n__h(X)
    3: activate(n__h(X)) -> h(X)
    4: activate(X) -> X
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... removes: 4 3 2
     h(x1)	weight: (/ 1 8) + x1
  n__h(x1)	weight: x1
activate(x1)	weight: (/ 1 4) + x1
     f(x1)	weight: (/ 1 8) + 2 * x1
     g(x1)	weight: x1
Number of strict rules: 1
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(X) -> #f(X)
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #1 }
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})	-#1->
  #f(X_{1})	--->*
  #f(X_{1})
  Looping with: [ X_{1} := X_{1}; ]
NO