(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic Path Order [LPO].
Precedence:
trivial
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), 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) TRUE