YES
0 QTRS
↳1 QTRSRRRProof (⇔, 0 ms)
↳2 QTRS
↳3 RisEmptyProof (⇔, 0 ms)
↳4 YES
f(s(X), Y) → h(s(f(h(Y), X)))
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
POL(f(x1, x2)) = 2 + 2·x1 + 2·x2
POL(h(x1)) = x1
POL(s(x1)) = 1 + x1
f(s(X), Y) → h(s(f(h(Y), X)))