(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(0, 1, x) → f(x, x, x)
f(x, y, z) → 2
0 → 2
1 → 2
g(x, x, y) → y
g(x, y, y) → x
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(0, 1, x) → F(x, x, x)
The TRS R consists of the following rules:
f(0, 1, x) → f(x, x, x)
f(x, y, z) → 2
0 → 2
1 → 2
g(x, x, y) → y
g(x, y, y) → x
Q is empty.
We have to consider all minimal (P,Q,R)-chains.