Termination w.r.t. Q of the given QTRS could not be shown:

(0) Obligation:

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.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:

eq > true
eq > false
inf₁ > cons > s
[take₂, nil] > cons > s
[take₂, nil] > 0

Status:

eq: []
inf₁: [1]
cons: []
true: []
false: []
s: []
take₂: [2,1]
length₁: [1]
0: []
nil: []

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

eq → true
eq → false
inf(X) → cons
take(0, X) → nil
take(s, cons) → cons
length(nil) → 0
length(cons) → s

(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

eq → eq

Q is empty.