Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, y, z) → g(x, y, z)
g(0, 1, x) → f(x, x, x)
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, y, z) → g(x, y, z)
g(0, 1, x) → f(x, x, x)
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
G(0, 1, x) → F(x, x, x)
F(x, y, z) → G(x, y, z)
The TRS R consists of the following rules:
f(x, y, z) → g(x, y, z)
g(0, 1, x) → f(x, x, x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
G(0, 1, x) → F(x, x, x)
F(x, y, z) → G(x, y, z)
The TRS R consists of the following rules:
f(x, y, z) → g(x, y, z)
g(0, 1, x) → f(x, x, x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.