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