(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(g(h(x, y)), f(a, a)) → f(h(x, x), g(f(y, a)))
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(a) = 1
POL(f(x1, x2)) = 2·x1 + x2
POL(g(x1)) = 2·x1
POL(h(x1, x2)) = 2·x1 + x2
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
f(g(h(x, y)), f(a, a)) → f(h(x, x), g(f(y, 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