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(f(a, x), a) → f(a, f(f(a, f(a, a)), x))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a, x), a) → f(a, f(f(a, f(a, a)), 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:
F(f(a, x), a) → F(a, a)
F(f(a, x), a) → F(f(a, f(a, a)), x)
F(f(a, x), a) → F(a, f(f(a, f(a, a)), x))
F(f(a, x), a) → F(a, f(a, a))
The TRS R consists of the following rules:
f(f(a, x), a) → f(a, f(f(a, f(a, a)), x))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
F(f(a, x), a) → F(a, a)
F(f(a, x), a) → F(f(a, f(a, a)), x)
F(f(a, x), a) → F(a, f(f(a, f(a, a)), x))
F(f(a, x), a) → F(a, f(a, a))
The TRS R consists of the following rules:
f(f(a, x), a) → f(a, f(f(a, f(a, a)), x))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
F(f(a, x), a) → F(f(a, f(a, a)), x)
The TRS R consists of the following rules:
f(f(a, x), a) → f(a, f(f(a, f(a, a)), x))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.