(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(X) → f(X)
c → a
c → b
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Recursive Path Order [RPO].
Precedence:
c > a
c > b
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
c → a
c → b
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(X) → f(X)
Q is empty.