(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

ff
g(b) → c
bc

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Precedence:
g1 > c
b > c

Status:
f: []
g1: [1]
b: []
c: []
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

g(b) → c
bc


(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

ff

Q is empty.