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