Input TRS:
    1: f(0(),1(),x) -> f(h(x),h(x),x)
    2: h(0()) -> 0()
    3: h(g(x,y)) -> y
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(0(),1(),x) -> #f(h(x),h(x),x)
   #2: #f(0(),1(),x) -> #h(x)
   #3: #f(0(),1(),x) -> #h(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...  failed.
MAYBE