(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
g(x, a, b) → g(b, b, a)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(a) = 1
POL(b) = 0
POL(g(x1, x2, x3)) = x1 + 2·x2 + x3
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
g(x, a, b) → g(b, b, a)
(2) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(3) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(4) YES