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