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:
eq → true
eq → eq
eq → false
inf(X) → cons
take(0, X) → nil
take(s, cons) → cons
length(nil) → 0
length(cons) → s
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
eq → true
eq → eq
eq → false
inf(X) → cons
take(0, X) → nil
take(s, cons) → cons
length(nil) → 0
length(cons) → s
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:
EQ → EQ
The TRS R consists of the following rules:
eq → true
eq → eq
eq → false
inf(X) → cons
take(0, X) → nil
take(s, cons) → cons
length(nil) → 0
length(cons) → s
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:
EQ → EQ
The TRS R consists of the following rules:
eq → true
eq → eq
eq → false
inf(X) → cons
take(0, X) → nil
take(s, cons) → cons
length(nil) → 0
length(cons) → s
Q is empty.
We have to consider all minimal (P,Q,R)-chains.