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