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:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(isNatIList(IL)) → ISNATLIST(IL)
ACTIVE(isNat(s(N))) → ISNAT(N)
ACTIVE(isNat(length(L))) → ISNATLIST(L)
ACTIVE(isNatIList(cons(N, IL))) → AND(isNat(N), isNatIList(IL))
ACTIVE(isNatIList(cons(N, IL))) → ISNAT(N)
ACTIVE(isNatIList(cons(N, IL))) → ISNATILIST(IL)
ACTIVE(isNatList(cons(N, L))) → AND(isNat(N), isNatList(L))
ACTIVE(isNatList(cons(N, L))) → ISNAT(N)
ACTIVE(isNatList(cons(N, L))) → ISNATLIST(L)
ACTIVE(isNatList(take(N, IL))) → AND(isNat(N), isNatIList(IL))
ACTIVE(isNatList(take(N, IL))) → ISNAT(N)
ACTIVE(isNatList(take(N, IL))) → ISNATILIST(IL)
ACTIVE(zeros) → CONS(0, zeros)
ACTIVE(take(0, IL)) → UTAKE1(isNatIList(IL))
ACTIVE(take(0, IL)) → ISNATILIST(IL)
ACTIVE(take(s(M), cons(N, IL))) → UTAKE2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL)
ACTIVE(take(s(M), cons(N, IL))) → AND(isNat(M), and(isNat(N), isNatIList(IL)))
ACTIVE(take(s(M), cons(N, IL))) → ISNAT(M)
ACTIVE(take(s(M), cons(N, IL))) → AND(isNat(N), isNatIList(IL))
ACTIVE(take(s(M), cons(N, IL))) → ISNAT(N)
ACTIVE(take(s(M), cons(N, IL))) → ISNATILIST(IL)
ACTIVE(uTake2(tt, M, N, IL)) → CONS(N, take(M, IL))
ACTIVE(uTake2(tt, M, N, IL)) → TAKE(M, IL)
ACTIVE(length(cons(N, L))) → ULENGTH(and(isNat(N), isNatList(L)), L)
ACTIVE(length(cons(N, L))) → AND(isNat(N), isNatList(L))
ACTIVE(length(cons(N, L))) → ISNAT(N)
ACTIVE(length(cons(N, L))) → ISNATLIST(L)
ACTIVE(uLength(tt, L)) → S(length(L))
ACTIVE(uLength(tt, L)) → LENGTH(L)
ACTIVE(and(X1, X2)) → AND(active(X1), X2)
ACTIVE(and(X1, X2)) → ACTIVE(X1)
ACTIVE(and(X1, X2)) → AND(X1, active(X2))
ACTIVE(and(X1, X2)) → ACTIVE(X2)
ACTIVE(s(X)) → S(active(X))
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(length(X)) → LENGTH(active(X))
ACTIVE(length(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → TAKE(active(X1), X2)
ACTIVE(take(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → TAKE(X1, active(X2))
ACTIVE(take(X1, X2)) → ACTIVE(X2)
ACTIVE(uTake1(X)) → UTAKE1(active(X))
ACTIVE(uTake1(X)) → ACTIVE(X)
ACTIVE(uTake2(X1, X2, X3, X4)) → UTAKE2(active(X1), X2, X3, X4)
ACTIVE(uTake2(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(uLength(X1, X2)) → ULENGTH(active(X1), X2)
ACTIVE(uLength(X1, X2)) → ACTIVE(X1)
AND(mark(X1), X2) → AND(X1, X2)
AND(X1, mark(X2)) → AND(X1, X2)
S(mark(X)) → S(X)
LENGTH(mark(X)) → LENGTH(X)
CONS(mark(X1), X2) → CONS(X1, X2)
TAKE(mark(X1), X2) → TAKE(X1, X2)
TAKE(X1, mark(X2)) → TAKE(X1, X2)
UTAKE1(mark(X)) → UTAKE1(X)
UTAKE2(mark(X1), X2, X3, X4) → UTAKE2(X1, X2, X3, X4)
ULENGTH(mark(X1), X2) → ULENGTH(X1, X2)
PROPER(and(X1, X2)) → AND(proper(X1), proper(X2))
PROPER(and(X1, X2)) → PROPER(X1)
PROPER(and(X1, X2)) → PROPER(X2)
PROPER(isNatIList(X)) → ISNATILIST(proper(X))
PROPER(isNatIList(X)) → PROPER(X)
PROPER(isNatList(X)) → ISNATLIST(proper(X))
PROPER(isNatList(X)) → PROPER(X)
PROPER(isNat(X)) → ISNAT(proper(X))
PROPER(isNat(X)) → PROPER(X)
PROPER(s(X)) → S(proper(X))
PROPER(s(X)) → PROPER(X)
PROPER(length(X)) → LENGTH(proper(X))
PROPER(length(X)) → PROPER(X)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(take(X1, X2)) → TAKE(proper(X1), proper(X2))
PROPER(take(X1, X2)) → PROPER(X1)
PROPER(take(X1, X2)) → PROPER(X2)
PROPER(uTake1(X)) → UTAKE1(proper(X))
PROPER(uTake1(X)) → PROPER(X)
PROPER(uTake2(X1, X2, X3, X4)) → UTAKE2(proper(X1), proper(X2), proper(X3), proper(X4))
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X1)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X2)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X3)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X4)
PROPER(uLength(X1, X2)) → ULENGTH(proper(X1), proper(X2))
PROPER(uLength(X1, X2)) → PROPER(X1)
PROPER(uLength(X1, X2)) → PROPER(X2)
AND(ok(X1), ok(X2)) → AND(X1, X2)
ISNATILIST(ok(X)) → ISNATILIST(X)
ISNATLIST(ok(X)) → ISNATLIST(X)
ISNAT(ok(X)) → ISNAT(X)
S(ok(X)) → S(X)
LENGTH(ok(X)) → LENGTH(X)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
TAKE(ok(X1), ok(X2)) → TAKE(X1, X2)
UTAKE1(ok(X)) → UTAKE1(X)
UTAKE2(ok(X1), ok(X2), ok(X3), ok(X4)) → UTAKE2(X1, X2, X3, X4)
ULENGTH(ok(X1), ok(X2)) → ULENGTH(X1, X2)
TOP(mark(X)) → TOP(proper(X))
TOP(mark(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
TOP(ok(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 14 SCCs with 52 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ISNAT(ok(X)) → ISNAT(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNAT(ok(X)) → ISNAT(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

ok₁ > ISNAT₁

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(8) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(9) TRUE

(10) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ISNATLIST(ok(X)) → ISNATLIST(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNATLIST(ok(X)) → ISNATLIST(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

ok₁ > ISNATLIST₁

The following usable rules [FROCOS05] were oriented: none

(12) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(13) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(14) TRUE

(15) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ISNATILIST(ok(X)) → ISNATILIST(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(16) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNATILIST(ok(X)) → ISNATILIST(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

ok₁ > ISNATILIST₁

The following usable rules [FROCOS05] were oriented: none

(17) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(18) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(19) TRUE

(20) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ULENGTH(ok(X1), ok(X2)) → ULENGTH(X1, X2)
ULENGTH(mark(X1), X2) → ULENGTH(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(21) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ULENGTH(ok(X1), ok(X2)) → ULENGTH(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ULENGTH(x1, x2)  =  ULENGTH(x2)
ok(x1)  =  ok(x1)
mark(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

ok₁ > ULENGTH₁

The following usable rules [FROCOS05] were oriented: none

(22) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ULENGTH(mark(X1), X2) → ULENGTH(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(23) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ULENGTH(mark(X1), X2) → ULENGTH(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ULENGTH(x1, x2)  =  ULENGTH(x1)
mark(x1)  =  mark(x1)

Recursive Path Order [RPO].
Precedence:

mark₁ > ULENGTH₁

The following usable rules [FROCOS05] were oriented: none

(24) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(25) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(26) TRUE

(27) Obligation:

Q DP problem:
The TRS P consists of the following rules:

UTAKE2(ok(X1), ok(X2), ok(X3), ok(X4)) → UTAKE2(X1, X2, X3, X4)
UTAKE2(mark(X1), X2, X3, X4) → UTAKE2(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(28) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

UTAKE2(ok(X1), ok(X2), ok(X3), ok(X4)) → UTAKE2(X1, X2, X3, X4)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
UTAKE2(x1, x2, x3, x4)  =  UTAKE2(x2, x3, x4)
ok(x1)  =  ok(x1)
mark(x1)  =  mark

Recursive Path Order [RPO].
Precedence:

mark > [UTAKE2₃, ok₁]

The following usable rules [FROCOS05] were oriented: none

(29) Obligation:

Q DP problem:
The TRS P consists of the following rules:

UTAKE2(mark(X1), X2, X3, X4) → UTAKE2(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(30) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

UTAKE2(mark(X1), X2, X3, X4) → UTAKE2(X1, X2, X3, X4)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(31) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(32) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(33) TRUE

(34) Obligation:

Q DP problem:
The TRS P consists of the following rules:

UTAKE1(ok(X)) → UTAKE1(X)
UTAKE1(mark(X)) → UTAKE1(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(35) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

UTAKE1(ok(X)) → UTAKE1(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
UTAKE1(x1)  =  UTAKE1(x1)
ok(x1)  =  ok(x1)
mark(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

[UTAKE1₁, ok₁]

The following usable rules [FROCOS05] were oriented: none

(36) Obligation:

Q DP problem:
The TRS P consists of the following rules:

UTAKE1(mark(X)) → UTAKE1(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(37) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

UTAKE1(mark(X)) → UTAKE1(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

mark₁ > UTAKE1₁

The following usable rules [FROCOS05] were oriented: none

(38) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(39) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(40) TRUE

(41) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TAKE(X1, mark(X2)) → TAKE(X1, X2)
TAKE(mark(X1), X2) → TAKE(X1, X2)
TAKE(ok(X1), ok(X2)) → TAKE(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(42) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

TAKE(X1, mark(X2)) → TAKE(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
TAKE(x1, x2)  =  TAKE(x2)
mark(x1)  =  mark(x1)
ok(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(43) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TAKE(mark(X1), X2) → TAKE(X1, X2)
TAKE(ok(X1), ok(X2)) → TAKE(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(44) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

TAKE(mark(X1), X2) → TAKE(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
TAKE(x1, x2)  =  TAKE(x1, x2)
mark(x1)  =  mark(x1)
ok(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(45) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TAKE(ok(X1), ok(X2)) → TAKE(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(46) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

TAKE(ok(X1), ok(X2)) → TAKE(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
TAKE(x1, x2)  =  x1
ok(x1)  =  ok(x1)

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(47) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(48) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(49) TRUE

(50) Obligation:

Q DP problem:
The TRS P consists of the following rules:

CONS(ok(X1), ok(X2)) → CONS(X1, X2)
CONS(mark(X1), X2) → CONS(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(51) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(ok(X1), ok(X2)) → CONS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2)  =  CONS(x2)
ok(x1)  =  ok(x1)
mark(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

ok₁ > CONS₁

The following usable rules [FROCOS05] were oriented: none

(52) Obligation:

Q DP problem:
The TRS P consists of the following rules:

CONS(mark(X1), X2) → CONS(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(53) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(mark(X1), X2) → CONS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2)  =  CONS(x1)
mark(x1)  =  mark(x1)

Recursive Path Order [RPO].
Precedence:

mark₁ > CONS₁

The following usable rules [FROCOS05] were oriented: none

(54) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(55) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(56) TRUE

(57) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LENGTH(ok(X)) → LENGTH(X)
LENGTH(mark(X)) → LENGTH(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(58) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

LENGTH(ok(X)) → LENGTH(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
LENGTH(x1)  =  LENGTH(x1)
ok(x1)  =  ok(x1)
mark(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

[LENGTH₁, ok₁]

The following usable rules [FROCOS05] were oriented: none

(59) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LENGTH(mark(X)) → LENGTH(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(60) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

LENGTH(mark(X)) → LENGTH(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

mark₁ > LENGTH₁

The following usable rules [FROCOS05] were oriented: none

(61) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(62) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(63) TRUE

(64) Obligation:

Q DP problem:
The TRS P consists of the following rules:

S(ok(X)) → S(X)
S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(65) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(ok(X)) → S(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
S(x1)  =  S(x1)
ok(x1)  =  ok(x1)
mark(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

[S₁, ok₁]

The following usable rules [FROCOS05] were oriented: none

(66) Obligation:

Q DP problem:
The TRS P consists of the following rules:

S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(67) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(mark(X)) → S(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

mark₁ > S₁

The following usable rules [FROCOS05] were oriented: none

(68) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(69) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(70) TRUE

(71) Obligation:

Q DP problem:
The TRS P consists of the following rules:

AND(X1, mark(X2)) → AND(X1, X2)
AND(mark(X1), X2) → AND(X1, X2)
AND(ok(X1), ok(X2)) → AND(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(72) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

AND(X1, mark(X2)) → AND(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
AND(x1, x2)  =  AND(x2)
mark(x1)  =  mark(x1)
ok(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(73) Obligation:

Q DP problem:
The TRS P consists of the following rules:

AND(mark(X1), X2) → AND(X1, X2)
AND(ok(X1), ok(X2)) → AND(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(74) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

AND(mark(X1), X2) → AND(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
AND(x1, x2)  =  AND(x1, x2)
mark(x1)  =  mark(x1)
ok(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(75) Obligation:

Q DP problem:
The TRS P consists of the following rules:

AND(ok(X1), ok(X2)) → AND(X1, X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(76) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

AND(ok(X1), ok(X2)) → AND(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
AND(x1, x2)  =  x1
ok(x1)  =  ok(x1)

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(77) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(78) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(79) TRUE

(80) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PROPER(and(X1, X2)) → PROPER(X2)
PROPER(and(X1, X2)) → PROPER(X1)
PROPER(isNatIList(X)) → PROPER(X)
PROPER(isNatList(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(length(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(take(X1, X2)) → PROPER(X1)
PROPER(take(X1, X2)) → PROPER(X2)
PROPER(uTake1(X)) → PROPER(X)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X1)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X2)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X3)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X4)
PROPER(uLength(X1, X2)) → PROPER(X1)
PROPER(uLength(X1, X2)) → PROPER(X2)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(81) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(and(X1, X2)) → PROPER(X2)
PROPER(and(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(take(X1, X2)) → PROPER(X1)
PROPER(take(X1, X2)) → PROPER(X2)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X1)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X2)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X3)
PROPER(uTake2(X1, X2, X3, X4)) → PROPER(X4)
PROPER(uLength(X1, X2)) → PROPER(X1)
PROPER(uLength(X1, X2)) → PROPER(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
and(x1, x2)  =  and(x1, x2)
isNatIList(x1)  =  x1
isNatList(x1)  =  x1
isNat(x1)  =  x1
s(x1)  =  x1
length(x1)  =  x1
cons(x1, x2)  =  cons(x1, x2)
take(x1, x2)  =  take(x1, x2)
uTake1(x1)  =  x1
uTake2(x1, x2, x3, x4)  =  uTake2(x1, x2, x3, x4)
uLength(x1, x2)  =  uLength(x1, x2)

Recursive Path Order [RPO].
Precedence:

uTake2₄ > [PROPER₁, and₂, cons₂, take₂, uLength₂]

The following usable rules [FROCOS05] were oriented: none

(82) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PROPER(isNatIList(X)) → PROPER(X)
PROPER(isNatList(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(length(X)) → PROPER(X)
PROPER(uTake1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(83) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(isNatIList(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
isNatIList(x1)  =  isNatIList(x1)
isNatList(x1)  =  x1
isNat(x1)  =  x1
s(x1)  =  x1
length(x1)  =  x1
uTake1(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

isNatIList₁ > PROPER₁

The following usable rules [FROCOS05] were oriented: none

(84) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PROPER(isNatList(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(length(X)) → PROPER(X)
PROPER(uTake1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(85) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(isNatList(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
isNatList(x1)  =  isNatList(x1)
isNat(x1)  =  x1
s(x1)  =  x1
length(x1)  =  x1
uTake1(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

[PROPER₁, isNatList₁]

The following usable rules [FROCOS05] were oriented: none

(86) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PROPER(isNat(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(length(X)) → PROPER(X)
PROPER(uTake1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(87) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(isNat(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
isNat(x1)  =  isNat(x1)
s(x1)  =  x1
length(x1)  =  x1
uTake1(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

[PROPER₁, isNat₁]

The following usable rules [FROCOS05] were oriented: none

(88) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PROPER(s(X)) → PROPER(X)
PROPER(length(X)) → PROPER(X)
PROPER(uTake1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(89) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(s(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
s(x1)  =  s(x1)
length(x1)  =  x1
uTake1(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

s₁ > PROPER₁

The following usable rules [FROCOS05] were oriented: none

(90) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PROPER(length(X)) → PROPER(X)
PROPER(uTake1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(91) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(length(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
length(x1)  =  length(x1)
uTake1(x1)  =  x1

Recursive Path Order [RPO].
Precedence:

[PROPER₁, length₁]

The following usable rules [FROCOS05] were oriented: none

(92) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PROPER(uTake1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(93) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(uTake1(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

uTake1₁ > PROPER₁

The following usable rules [FROCOS05] were oriented: none

(94) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(95) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(96) TRUE

(97) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(and(X1, X2)) → ACTIVE(X2)
ACTIVE(and(X1, X2)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(length(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → ACTIVE(X2)
ACTIVE(uTake1(X)) → ACTIVE(X)
ACTIVE(uTake2(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(uLength(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(98) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(and(X1, X2)) → ACTIVE(X2)
ACTIVE(and(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → ACTIVE(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
and(x1, x2)  =  and(x1, x2)
s(x1)  =  x1
length(x1)  =  x1
cons(x1, x2)  =  x1
take(x1, x2)  =  take(x1, x2)
uTake1(x1)  =  x1
uTake2(x1, x2, x3, x4)  =  x1
uLength(x1, x2)  =  x1

Recursive Path Order [RPO].
Precedence:

take₂ > ACTIVE₁

The following usable rules [FROCOS05] were oriented: none

(99) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(length(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(uTake1(X)) → ACTIVE(X)
ACTIVE(uTake2(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(uLength(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(100) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(length(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
s(x1)  =  s(x1)
length(x1)  =  length(x1)
cons(x1, x2)  =  cons(x1, x2)
uTake1(x1)  =  x1
uTake2(x1, x2, x3, x4)  =  x1
uLength(x1, x2)  =  x1

Recursive Path Order [RPO].
Precedence:

s₁ > ACTIVE₁
length₁ > ACTIVE₁
cons₂ > ACTIVE₁

The following usable rules [FROCOS05] were oriented: none

(101) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(uTake1(X)) → ACTIVE(X)
ACTIVE(uTake2(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(uLength(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(102) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(uTake2(X1, X2, X3, X4)) → ACTIVE(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
uTake1(x1)  =  x1
uTake2(x1, x2, x3, x4)  =  uTake2(x1, x2, x3, x4)
uLength(x1, x2)  =  x1

Recursive Path Order [RPO].
Precedence:

[ACTIVE₁, uTake2₄]

The following usable rules [FROCOS05] were oriented: none

(103) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(uTake1(X)) → ACTIVE(X)
ACTIVE(uLength(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(104) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(uTake1(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
uTake1(x1)  =  uTake1(x1)
uLength(x1, x2)  =  x1

Recursive Path Order [RPO].
Precedence:

uTake1₁ > ACTIVE₁

The following usable rules [FROCOS05] were oriented: none

(105) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(uLength(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(106) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(uLength(X1, X2)) → ACTIVE(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

uLength₂ > ACTIVE₁

The following usable rules [FROCOS05] were oriented: none

(107) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(108) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(109) TRUE

(110) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(X)) → TOP(active(X))
TOP(mark(X)) → TOP(proper(X))

The TRS R consists of the following rules:

active(and(tt, T)) → mark(T)
active(isNatIList(IL)) → mark(isNatList(IL))
active(isNat(0)) → mark(tt)
active(isNat(s(N))) → mark(isNat(N))
active(isNat(length(L))) → mark(isNatList(L))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(N, L))) → mark(and(isNat(N), isNatList(L)))
active(isNatList(take(N, IL))) → mark(and(isNat(N), isNatIList(IL)))
active(zeros) → mark(cons(0, zeros))
active(take(0, IL)) → mark(uTake1(isNatIList(IL)))
active(uTake1(tt)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(uTake2(and(isNat(M), and(isNat(N), isNatIList(IL))), M, N, IL))
active(uTake2(tt, M, N, IL)) → mark(cons(N, take(M, IL)))
active(length(cons(N, L))) → mark(uLength(and(isNat(N), isNatList(L)), L))
active(uLength(tt, L)) → mark(s(length(L)))
active(and(X1, X2)) → and(active(X1), X2)
active(and(X1, X2)) → and(X1, active(X2))
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(uTake1(X)) → uTake1(active(X))
active(uTake2(X1, X2, X3, X4)) → uTake2(active(X1), X2, X3, X4)
active(uLength(X1, X2)) → uLength(active(X1), X2)
and(mark(X1), X2) → mark(and(X1, X2))
and(X1, mark(X2)) → mark(and(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
uTake1(mark(X)) → mark(uTake1(X))
uTake2(mark(X1), X2, X3, X4) → mark(uTake2(X1, X2, X3, X4))
uLength(mark(X1), X2) → mark(uLength(X1, X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(isNatIList(X)) → isNatIList(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(uTake1(X)) → uTake1(proper(X))
proper(uTake2(X1, X2, X3, X4)) → uTake2(proper(X1), proper(X2), proper(X3), proper(X4))
proper(uLength(X1, X2)) → uLength(proper(X1), proper(X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
isNatList(ok(X)) → ok(isNatList(X))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
uTake1(ok(X)) → ok(uTake1(X))
uTake2(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(uTake2(X1, X2, X3, X4))
uLength(ok(X1), ok(X2)) → ok(uLength(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.