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