Input TRS:
    1: g(tt(),x,y) -> g(f(x,y),s(x),s(y))
    2: f(s(x),y) -> f(x,y)
    3: f(x,s(y)) -> f(x,y)
    4: f(0(),0()) -> tt()
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(s(x),y) -> #f(x,y)
   #2: #f(x,s(y)) -> #f(x,y)
   #3: #g(tt(),x,y) -> #g(f(x,y),s(x),s(y))
   #4: #g(tt(),x,y) -> #f(x,y)
Number of SCCs: 2, DPs: 3, edges: 5
	SCC { #3 }
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