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