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