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