Input TRS:
    1: h(|1|()) -> h(|0|())
    2: f(s(U),X,|0|(),Y) -> f(s(|0|()),g(X,h(|1|()),X),g(X,h(|1|()),X),Y)
    3: f(Z,X,g(Y,h(|0|()),Y),s(U)) -> f(Z,X,Y,s(s(|0|())))
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing h
1: h❆1_|1|() -> h❆1_|0|()
2: f(s(U),X,|0|(),Y) -> f(s(|0|()),g(X,h❆1_|1|(),X),g(X,h❆1_|1|(),X),Y)
3: f(Z,X,g(Y,h❆1_|0|(),Y),s(U)) -> f(Z,X,Y,s(s(|0|())))
4: h(|0|()) ->= h❆1_|0|()
5: h(|1|()) ->= h❆1_|1|()
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Dependency Pairs:
   #1: #f(s(U),X,|0|(),Y) -> #f(s(|0|()),g(X,h❆1_|1|(),X),g(X,h❆1_|1|(),X),Y)
   #2: #f(s(U),X,|0|(),Y) -> #h❆1_|1|()
   #3: #f(s(U),X,|0|(),Y) -> #h❆1_|1|()
   #4: #h(|1|()) ->? #h❆1_|1|()
   #5: #f(Z,X,g(Y,h❆1_|0|(),Y),s(U)) -> #f(Z,X,Y,s(s(|0|())))
Number of SCCs: 1, DPs: 2, edges: 3
	SCC { #1 #5 }
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