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