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