(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(X, g(X), Y) → f(Y, Y, Y)
g(b) → c
b → c
Q is empty.
(1) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(2) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(X, g(X), Y) → F(Y, Y, Y)
The TRS R consists of the following rules:
f(X, g(X), Y) → f(Y, Y, Y)
g(b) → c
b → c
Q is empty.
We have to consider all minimal (P,Q,R)-chains.