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:
Recursive path order with status [RPO].
Quasi-Precedence:

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

Status:

eq: multiset
true: multiset
false: multiset
inf₁: multiset
cons: multiset
take₂: multiset
0: multiset
nil: multiset
s: multiset
length₁: multiset

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

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 → true
eq → eq

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:

eq > true

Status:

eq: multiset
true: multiset

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

eq → true

(4) Obligation:

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

eq → eq

Q is empty.