Input TRS:
    1: f(g(x),s(0()),y) -> f(g(s(0())),y,g(x))
    2: g(s(x)) -> s(g(x))
    3: g(0()) -> 0()
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #g(s(x)) -> #g(x)
   #2: #f(g(x),s(0()),y) -> #f(g(s(0())),y,g(x))
   #3: #f(g(x),s(0()),y) -> #g(s(0()))
Number of SCCs: 2, DPs: 2, edges: 2
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: (/ 1 2) + x1
     f(x1,x2,x3)	weight: 0
     0()	weight: 0
   #f(x1,x2,x3)	weight: 0
   #g(x1)	weight: x1
     g(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #1
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...  failed.
MAYBE