(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, x) → a
f(g(x), y) → f(x, y)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:
[f2, a]
Status:
a: multiset
f2: [2,1]
g1: multiset
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
f(x, x) → a
f(g(x), y) → f(x, y)
(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) TRUE