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:
s1(s1(s0(s0(x)))) → s0(s0(s0(s1(s1(s1(x))))))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
s1(s1(s0(s0(x)))) → s0(s0(s0(s1(s1(s1(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:
S1(s1(s0(s0(x)))) → S1(x)
S1(s1(s0(s0(x)))) → S1(s1(x))
S1(s1(s0(s0(x)))) → S1(s1(s1(x)))
The TRS R consists of the following rules:
s1(s1(s0(s0(x)))) → s0(s0(s0(s1(s1(s1(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:
S1(s1(s0(s0(x)))) → S1(x)
S1(s1(s0(s0(x)))) → S1(s1(x))
S1(s1(s0(s0(x)))) → S1(s1(s1(x)))
The TRS R consists of the following rules:
s1(s1(s0(s0(x)))) → s0(s0(s0(s1(s1(s1(x))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.