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