Input TRS:
    1: f(X,g(X)) -> f(1(),g(X))
    2: g(1()) -> g(0())
Number of strict rules: 2
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #g(1()) -> #g(0())
   #2: #f(X,g(X)) -> #f(1(),g(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(1(),g(1()))	-#2->
  #f(1(),g(1()))	--->*
  #f(1(),g(1()))
  Looping with: [ ]
NO