(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(X) → f(a)
b → a
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
f1 > a
b > a
Status:
f1: [1]
a: []
b: []
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
b → a
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(X) → f(a)
Q is empty.