YES
0 QTRS
↳1 QTRSRRRProof (⇔, 0 ms)
↳2 QTRS
↳3 RisEmptyProof (⇔, 0 ms)
↳4 YES
h(f(x), y) → f(g(x, y))
g(x, y) → h(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)) = 2 + x1
POL(g(x1, x2)) = 1 + 2·x1 + x2
POL(h(x1, x2)) = 2·x1 + x2
h(f(x), y) → f(g(x, y))
g(x, y) → h(x, y)