(0) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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(zeros) → MARK(cons(0, zeros))
ACTIVE(zeros) → CONS(0, zeros)
ACTIVE(U11(tt)) → MARK(tt)
ACTIVE(U21(tt)) → MARK(tt)
ACTIVE(U31(tt)) → MARK(tt)
ACTIVE(U41(tt, V2)) → MARK(U42(isNatIList(V2)))
ACTIVE(U41(tt, V2)) → U421(isNatIList(V2))
ACTIVE(U41(tt, V2)) → ISNATILIST(V2)
ACTIVE(U42(tt)) → MARK(tt)
ACTIVE(U51(tt, V2)) → MARK(U52(isNatList(V2)))
ACTIVE(U51(tt, V2)) → U521(isNatList(V2))
ACTIVE(U51(tt, V2)) → ISNATLIST(V2)
ACTIVE(U52(tt)) → MARK(tt)
ACTIVE(U61(tt, V2)) → MARK(U62(isNatIList(V2)))
ACTIVE(U61(tt, V2)) → U621(isNatIList(V2))
ACTIVE(U61(tt, V2)) → ISNATILIST(V2)
ACTIVE(U62(tt)) → MARK(tt)
ACTIVE(U71(tt, L, N)) → MARK(U72(isNat(N), L))
ACTIVE(U71(tt, L, N)) → U721(isNat(N), L)
ACTIVE(U71(tt, L, N)) → ISNAT(N)
ACTIVE(U72(tt, L)) → MARK(s(length(L)))
ACTIVE(U72(tt, L)) → S(length(L))
ACTIVE(U72(tt, L)) → LENGTH(L)
ACTIVE(U81(tt)) → MARK(nil)
ACTIVE(U91(tt, IL, M, N)) → MARK(U92(isNat(M), IL, M, N))
ACTIVE(U91(tt, IL, M, N)) → U921(isNat(M), IL, M, N)
ACTIVE(U91(tt, IL, M, N)) → ISNAT(M)
ACTIVE(U92(tt, IL, M, N)) → MARK(U93(isNat(N), IL, M, N))
ACTIVE(U92(tt, IL, M, N)) → U931(isNat(N), IL, M, N)
ACTIVE(U92(tt, IL, M, N)) → ISNAT(N)
ACTIVE(U93(tt, IL, M, N)) → MARK(cons(N, take(M, IL)))
ACTIVE(U93(tt, IL, M, N)) → CONS(N, take(M, IL))
ACTIVE(U93(tt, IL, M, N)) → TAKE(M, IL)
ACTIVE(isNat(0)) → MARK(tt)
ACTIVE(isNat(length(V1))) → MARK(U11(isNatList(V1)))
ACTIVE(isNat(length(V1))) → U111(isNatList(V1))
ACTIVE(isNat(length(V1))) → ISNATLIST(V1)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
ACTIVE(isNat(s(V1))) → U211(isNat(V1))
ACTIVE(isNat(s(V1))) → ISNAT(V1)
ACTIVE(isNatIList(V)) → MARK(U31(isNatList(V)))
ACTIVE(isNatIList(V)) → U311(isNatList(V))
ACTIVE(isNatIList(V)) → ISNATLIST(V)
ACTIVE(isNatIList(zeros)) → MARK(tt)
ACTIVE(isNatIList(cons(V1, V2))) → MARK(U41(isNat(V1), V2))
ACTIVE(isNatIList(cons(V1, V2))) → U411(isNat(V1), V2)
ACTIVE(isNatIList(cons(V1, V2))) → ISNAT(V1)
ACTIVE(isNatList(nil)) → MARK(tt)
ACTIVE(isNatList(cons(V1, V2))) → MARK(U51(isNat(V1), V2))
ACTIVE(isNatList(cons(V1, V2))) → U511(isNat(V1), V2)
ACTIVE(isNatList(cons(V1, V2))) → ISNAT(V1)
ACTIVE(isNatList(take(V1, V2))) → MARK(U61(isNat(V1), V2))
ACTIVE(isNatList(take(V1, V2))) → U611(isNat(V1), V2)
ACTIVE(isNatList(take(V1, V2))) → ISNAT(V1)
ACTIVE(length(nil)) → MARK(0)
ACTIVE(length(cons(N, L))) → MARK(U71(isNatList(L), L, N))
ACTIVE(length(cons(N, L))) → U711(isNatList(L), L, N)
ACTIVE(length(cons(N, L))) → ISNATLIST(L)
ACTIVE(take(0, IL)) → MARK(U81(isNatIList(IL)))
ACTIVE(take(0, IL)) → U811(isNatIList(IL))
ACTIVE(take(0, IL)) → ISNATILIST(IL)
ACTIVE(take(s(M), cons(N, IL))) → MARK(U91(isNatIList(IL), IL, M, N))
ACTIVE(take(s(M), cons(N, IL))) → U911(isNatIList(IL), IL, M, N)
ACTIVE(take(s(M), cons(N, IL))) → ISNATILIST(IL)
MARK(zeros) → ACTIVE(zeros)
MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
MARK(cons(X1, X2)) → CONS(mark(X1), X2)
MARK(cons(X1, X2)) → MARK(X1)
MARK(0) → ACTIVE(0)
MARK(U11(X)) → ACTIVE(U11(mark(X)))
MARK(U11(X)) → U111(mark(X))
MARK(U11(X)) → MARK(X)
MARK(tt) → ACTIVE(tt)
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U21(X)) → U211(mark(X))
MARK(U21(X)) → MARK(X)
MARK(U31(X)) → ACTIVE(U31(mark(X)))
MARK(U31(X)) → U311(mark(X))
MARK(U31(X)) → MARK(X)
MARK(U41(X1, X2)) → ACTIVE(U41(mark(X1), X2))
MARK(U41(X1, X2)) → U411(mark(X1), X2)
MARK(U41(X1, X2)) → MARK(X1)
MARK(U42(X)) → ACTIVE(U42(mark(X)))
MARK(U42(X)) → U421(mark(X))
MARK(U42(X)) → MARK(X)
MARK(isNatIList(X)) → ACTIVE(isNatIList(X))
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
MARK(U51(X1, X2)) → U511(mark(X1), X2)
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X)) → ACTIVE(U52(mark(X)))
MARK(U52(X)) → U521(mark(X))
MARK(U52(X)) → MARK(X)
MARK(isNatList(X)) → ACTIVE(isNatList(X))
MARK(U61(X1, X2)) → ACTIVE(U61(mark(X1), X2))
MARK(U61(X1, X2)) → U611(mark(X1), X2)
MARK(U61(X1, X2)) → MARK(X1)
MARK(U62(X)) → ACTIVE(U62(mark(X)))
MARK(U62(X)) → U621(mark(X))
MARK(U62(X)) → MARK(X)
MARK(U71(X1, X2, X3)) → ACTIVE(U71(mark(X1), X2, X3))
MARK(U71(X1, X2, X3)) → U711(mark(X1), X2, X3)
MARK(U71(X1, X2, X3)) → MARK(X1)
MARK(U72(X1, X2)) → ACTIVE(U72(mark(X1), X2))
MARK(U72(X1, X2)) → U721(mark(X1), X2)
MARK(U72(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → S(mark(X))
MARK(s(X)) → MARK(X)
MARK(length(X)) → ACTIVE(length(mark(X)))
MARK(length(X)) → LENGTH(mark(X))
MARK(length(X)) → MARK(X)
MARK(U81(X)) → ACTIVE(U81(mark(X)))
MARK(U81(X)) → U811(mark(X))
MARK(U81(X)) → MARK(X)
MARK(nil) → ACTIVE(nil)
MARK(U91(X1, X2, X3, X4)) → ACTIVE(U91(mark(X1), X2, X3, X4))
MARK(U91(X1, X2, X3, X4)) → U911(mark(X1), X2, X3, X4)
MARK(U91(X1, X2, X3, X4)) → MARK(X1)
MARK(U92(X1, X2, X3, X4)) → ACTIVE(U92(mark(X1), X2, X3, X4))
MARK(U92(X1, X2, X3, X4)) → U921(mark(X1), X2, X3, X4)
MARK(U92(X1, X2, X3, X4)) → MARK(X1)
MARK(U93(X1, X2, X3, X4)) → ACTIVE(U93(mark(X1), X2, X3, X4))
MARK(U93(X1, X2, X3, X4)) → U931(mark(X1), X2, X3, X4)
MARK(U93(X1, X2, X3, X4)) → MARK(X1)
MARK(take(X1, X2)) → ACTIVE(take(mark(X1), mark(X2)))
MARK(take(X1, X2)) → TAKE(mark(X1), mark(X2))
MARK(take(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X2)
CONS(mark(X1), X2) → CONS(X1, X2)
CONS(X1, mark(X2)) → CONS(X1, X2)
CONS(active(X1), X2) → CONS(X1, X2)
CONS(X1, active(X2)) → CONS(X1, X2)
U111(mark(X)) → U111(X)
U111(active(X)) → U111(X)
U211(mark(X)) → U211(X)
U211(active(X)) → U211(X)
U311(mark(X)) → U311(X)
U311(active(X)) → U311(X)
U411(mark(X1), X2) → U411(X1, X2)
U411(X1, mark(X2)) → U411(X1, X2)
U411(active(X1), X2) → U411(X1, X2)
U411(X1, active(X2)) → U411(X1, X2)
U421(mark(X)) → U421(X)
U421(active(X)) → U421(X)
ISNATILIST(mark(X)) → ISNATILIST(X)
ISNATILIST(active(X)) → ISNATILIST(X)
U511(mark(X1), X2) → U511(X1, X2)
U511(X1, mark(X2)) → U511(X1, X2)
U511(active(X1), X2) → U511(X1, X2)
U511(X1, active(X2)) → U511(X1, X2)
U521(mark(X)) → U521(X)
U521(active(X)) → U521(X)
ISNATLIST(mark(X)) → ISNATLIST(X)
ISNATLIST(active(X)) → ISNATLIST(X)
U611(mark(X1), X2) → U611(X1, X2)
U611(X1, mark(X2)) → U611(X1, X2)
U611(active(X1), X2) → U611(X1, X2)
U611(X1, active(X2)) → U611(X1, X2)
U621(mark(X)) → U621(X)
U621(active(X)) → U621(X)
U711(mark(X1), X2, X3) → U711(X1, X2, X3)
U711(X1, mark(X2), X3) → U711(X1, X2, X3)
U711(X1, X2, mark(X3)) → U711(X1, X2, X3)
U711(active(X1), X2, X3) → U711(X1, X2, X3)
U711(X1, active(X2), X3) → U711(X1, X2, X3)
U711(X1, X2, active(X3)) → U711(X1, X2, X3)
U721(mark(X1), X2) → U721(X1, X2)
U721(X1, mark(X2)) → U721(X1, X2)
U721(active(X1), X2) → U721(X1, X2)
U721(X1, active(X2)) → U721(X1, X2)
ISNAT(mark(X)) → ISNAT(X)
ISNAT(active(X)) → ISNAT(X)
S(mark(X)) → S(X)
S(active(X)) → S(X)
LENGTH(mark(X)) → LENGTH(X)
LENGTH(active(X)) → LENGTH(X)
U811(mark(X)) → U811(X)
U811(active(X)) → U811(X)
U911(mark(X1), X2, X3, X4) → U911(X1, X2, X3, X4)
U911(X1, mark(X2), X3, X4) → U911(X1, X2, X3, X4)
U911(X1, X2, mark(X3), X4) → U911(X1, X2, X3, X4)
U911(X1, X2, X3, mark(X4)) → U911(X1, X2, X3, X4)
U911(active(X1), X2, X3, X4) → U911(X1, X2, X3, X4)
U911(X1, active(X2), X3, X4) → U911(X1, X2, X3, X4)
U911(X1, X2, active(X3), X4) → U911(X1, X2, X3, X4)
U911(X1, X2, X3, active(X4)) → U911(X1, X2, X3, X4)
U921(mark(X1), X2, X3, X4) → U921(X1, X2, X3, X4)
U921(X1, mark(X2), X3, X4) → U921(X1, X2, X3, X4)
U921(X1, X2, mark(X3), X4) → U921(X1, X2, X3, X4)
U921(X1, X2, X3, mark(X4)) → U921(X1, X2, X3, X4)
U921(active(X1), X2, X3, X4) → U921(X1, X2, X3, X4)
U921(X1, active(X2), X3, X4) → U921(X1, X2, X3, X4)
U921(X1, X2, active(X3), X4) → U921(X1, X2, X3, X4)
U921(X1, X2, X3, active(X4)) → U921(X1, X2, X3, X4)
U931(mark(X1), X2, X3, X4) → U931(X1, X2, X3, X4)
U931(X1, mark(X2), X3, X4) → U931(X1, X2, X3, X4)
U931(X1, X2, mark(X3), X4) → U931(X1, X2, X3, X4)
U931(X1, X2, X3, mark(X4)) → U931(X1, X2, X3, X4)
U931(active(X1), X2, X3, X4) → U931(X1, X2, X3, X4)
U931(X1, active(X2), X3, X4) → U931(X1, X2, X3, X4)
U931(X1, X2, active(X3), X4) → U931(X1, X2, X3, X4)
U931(X1, X2, X3, active(X4)) → U931(X1, X2, X3, X4)
TAKE(mark(X1), X2) → TAKE(X1, X2)
TAKE(X1, mark(X2)) → TAKE(X1, X2)
TAKE(active(X1), X2) → TAKE(X1, X2)
TAKE(X1, active(X2)) → TAKE(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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 23 SCCs with 68 less nodes.

(4) Complex Obligation (AND)

(5) 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(active(X1), X2) → TAKE(X1, X2)
TAKE(X1, active(X2)) → TAKE(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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.


TAKE(X1, mark(X2)) → TAKE(X1, X2)
TAKE(X1, active(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)  =  x2
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

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

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(8) 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)
mark(x1)  =  mark(x1)
active(x1)  =  x1

Recursive path order with status [RPO].
Precedence:
mark1 > TAKE1

Status:
TAKE1: multiset
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

TAKE(active(X1), X2) → TAKE(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


TAKE(active(X1), X2) → TAKE(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
active1 > TAKE2

Status:
TAKE2: [1,2]
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(11) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(12) PisEmptyProof (EQUIVALENT transformation)

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

(13) TRUE

(14) Obligation:

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

U931(X1, mark(X2), X3, X4) → U931(X1, X2, X3, X4)
U931(mark(X1), X2, X3, X4) → U931(X1, X2, X3, X4)
U931(X1, X2, mark(X3), X4) → U931(X1, X2, X3, X4)
U931(X1, X2, X3, mark(X4)) → U931(X1, X2, X3, X4)
U931(active(X1), X2, X3, X4) → U931(X1, X2, X3, X4)
U931(X1, active(X2), X3, X4) → U931(X1, X2, X3, X4)
U931(X1, X2, active(X3), X4) → U931(X1, X2, X3, X4)
U931(X1, X2, X3, active(X4)) → U931(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U931(mark(X1), X2, X3, X4) → U931(X1, X2, X3, X4)
U931(active(X1), X2, X3, X4) → U931(X1, X2, X3, X4)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U931(x1, x2, x3, x4)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(16) Obligation:

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

U931(X1, mark(X2), X3, X4) → U931(X1, X2, X3, X4)
U931(X1, X2, mark(X3), X4) → U931(X1, X2, X3, X4)
U931(X1, X2, X3, mark(X4)) → U931(X1, X2, X3, X4)
U931(X1, active(X2), X3, X4) → U931(X1, X2, X3, X4)
U931(X1, X2, active(X3), X4) → U931(X1, X2, X3, X4)
U931(X1, X2, X3, active(X4)) → U931(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(17) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U931(X1, mark(X2), X3, X4) → U931(X1, X2, X3, X4)
U931(X1, X2, mark(X3), X4) → U931(X1, X2, X3, X4)
U931(X1, X2, X3, mark(X4)) → U931(X1, X2, X3, X4)
U931(X1, active(X2), X3, X4) → U931(X1, X2, X3, X4)
U931(X1, X2, active(X3), X4) → U931(X1, X2, X3, X4)
U931(X1, X2, X3, active(X4)) → U931(X1, X2, X3, X4)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U93^14
active1 > U93^14

Status:
U93^14: [4,3,1,2]
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(18) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(19) PisEmptyProof (EQUIVALENT transformation)

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

(20) TRUE

(21) Obligation:

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

U921(X1, mark(X2), X3, X4) → U921(X1, X2, X3, X4)
U921(mark(X1), X2, X3, X4) → U921(X1, X2, X3, X4)
U921(X1, X2, mark(X3), X4) → U921(X1, X2, X3, X4)
U921(X1, X2, X3, mark(X4)) → U921(X1, X2, X3, X4)
U921(active(X1), X2, X3, X4) → U921(X1, X2, X3, X4)
U921(X1, active(X2), X3, X4) → U921(X1, X2, X3, X4)
U921(X1, X2, active(X3), X4) → U921(X1, X2, X3, X4)
U921(X1, X2, X3, active(X4)) → U921(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U921(mark(X1), X2, X3, X4) → U921(X1, X2, X3, X4)
U921(active(X1), X2, X3, X4) → U921(X1, X2, X3, X4)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U921(x1, x2, x3, x4)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(23) Obligation:

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

U921(X1, mark(X2), X3, X4) → U921(X1, X2, X3, X4)
U921(X1, X2, mark(X3), X4) → U921(X1, X2, X3, X4)
U921(X1, X2, X3, mark(X4)) → U921(X1, X2, X3, X4)
U921(X1, active(X2), X3, X4) → U921(X1, X2, X3, X4)
U921(X1, X2, active(X3), X4) → U921(X1, X2, X3, X4)
U921(X1, X2, X3, active(X4)) → U921(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(24) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U921(X1, mark(X2), X3, X4) → U921(X1, X2, X3, X4)
U921(X1, X2, mark(X3), X4) → U921(X1, X2, X3, X4)
U921(X1, X2, X3, mark(X4)) → U921(X1, X2, X3, X4)
U921(X1, active(X2), X3, X4) → U921(X1, X2, X3, X4)
U921(X1, X2, active(X3), X4) → U921(X1, X2, X3, X4)
U921(X1, X2, X3, active(X4)) → U921(X1, X2, X3, X4)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U92^14
active1 > U92^14

Status:
U92^14: [4,3,1,2]
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(25) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(26) PisEmptyProof (EQUIVALENT transformation)

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

(27) TRUE

(28) Obligation:

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

U911(X1, mark(X2), X3, X4) → U911(X1, X2, X3, X4)
U911(mark(X1), X2, X3, X4) → U911(X1, X2, X3, X4)
U911(X1, X2, mark(X3), X4) → U911(X1, X2, X3, X4)
U911(X1, X2, X3, mark(X4)) → U911(X1, X2, X3, X4)
U911(active(X1), X2, X3, X4) → U911(X1, X2, X3, X4)
U911(X1, active(X2), X3, X4) → U911(X1, X2, X3, X4)
U911(X1, X2, active(X3), X4) → U911(X1, X2, X3, X4)
U911(X1, X2, X3, active(X4)) → U911(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(29) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U911(mark(X1), X2, X3, X4) → U911(X1, X2, X3, X4)
U911(active(X1), X2, X3, X4) → U911(X1, X2, X3, X4)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U911(x1, x2, x3, x4)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(30) Obligation:

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

U911(X1, mark(X2), X3, X4) → U911(X1, X2, X3, X4)
U911(X1, X2, mark(X3), X4) → U911(X1, X2, X3, X4)
U911(X1, X2, X3, mark(X4)) → U911(X1, X2, X3, X4)
U911(X1, active(X2), X3, X4) → U911(X1, X2, X3, X4)
U911(X1, X2, active(X3), X4) → U911(X1, X2, X3, X4)
U911(X1, X2, X3, active(X4)) → U911(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(31) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U911(X1, mark(X2), X3, X4) → U911(X1, X2, X3, X4)
U911(X1, X2, mark(X3), X4) → U911(X1, X2, X3, X4)
U911(X1, X2, X3, mark(X4)) → U911(X1, X2, X3, X4)
U911(X1, active(X2), X3, X4) → U911(X1, X2, X3, X4)
U911(X1, X2, active(X3), X4) → U911(X1, X2, X3, X4)
U911(X1, X2, X3, active(X4)) → U911(X1, X2, X3, X4)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U91^14
active1 > U91^14

Status:
U91^14: [4,3,1,2]
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(32) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(33) PisEmptyProof (EQUIVALENT transformation)

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

(34) TRUE

(35) Obligation:

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

U811(active(X)) → U811(X)
U811(mark(X)) → U811(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(36) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(37) Obligation:

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

U811(mark(X)) → U811(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(38) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U811(mark(X)) → U811(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U81^11

Status:
U81^11: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(39) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(40) PisEmptyProof (EQUIVALENT transformation)

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

(41) TRUE

(42) Obligation:

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

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

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(43) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(44) 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(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(45) 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 with status [RPO].
Precedence:
mark1 > LENGTH1

Status:
LENGTH1: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(46) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(47) PisEmptyProof (EQUIVALENT transformation)

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

(48) TRUE

(49) Obligation:

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

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

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(50) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(51) 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(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(52) 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 with status [RPO].
Precedence:
mark1 > S1

Status:
S1: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(53) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(54) PisEmptyProof (EQUIVALENT transformation)

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

(55) TRUE

(56) Obligation:

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

ISNAT(active(X)) → ISNAT(X)
ISNAT(mark(X)) → ISNAT(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(57) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(58) Obligation:

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

ISNAT(mark(X)) → ISNAT(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(59) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


ISNAT(mark(X)) → ISNAT(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > ISNAT1

Status:
ISNAT1: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(60) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(61) PisEmptyProof (EQUIVALENT transformation)

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

(62) TRUE

(63) Obligation:

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

U721(X1, mark(X2)) → U721(X1, X2)
U721(mark(X1), X2) → U721(X1, X2)
U721(active(X1), X2) → U721(X1, X2)
U721(X1, active(X2)) → U721(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(64) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(65) Obligation:

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

U721(mark(X1), X2) → U721(X1, X2)
U721(active(X1), X2) → U721(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(66) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
mark1 > U72^11

Status:
U72^11: multiset
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(67) Obligation:

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

U721(active(X1), X2) → U721(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(68) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U721(active(X1), X2) → U721(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
active1 > U72^12

Status:
U72^12: [1,2]
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(69) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(70) PisEmptyProof (EQUIVALENT transformation)

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

(71) TRUE

(72) Obligation:

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

U711(X1, mark(X2), X3) → U711(X1, X2, X3)
U711(mark(X1), X2, X3) → U711(X1, X2, X3)
U711(X1, X2, mark(X3)) → U711(X1, X2, X3)
U711(active(X1), X2, X3) → U711(X1, X2, X3)
U711(X1, active(X2), X3) → U711(X1, X2, X3)
U711(X1, X2, active(X3)) → U711(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(73) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U711(mark(X1), X2, X3) → U711(X1, X2, X3)
U711(active(X1), X2, X3) → U711(X1, X2, X3)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U711(x1, x2, x3)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(74) Obligation:

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

U711(X1, mark(X2), X3) → U711(X1, X2, X3)
U711(X1, X2, mark(X3)) → U711(X1, X2, X3)
U711(X1, active(X2), X3) → U711(X1, X2, X3)
U711(X1, X2, active(X3)) → U711(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(75) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U711(X1, mark(X2), X3) → U711(X1, X2, X3)
U711(X1, X2, mark(X3)) → U711(X1, X2, X3)
U711(X1, active(X2), X3) → U711(X1, X2, X3)
U711(X1, X2, active(X3)) → U711(X1, X2, X3)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U711(x1, x2, x3)  =  U711(x2, x3)
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)

Recursive path order with status [RPO].
Precedence:
mark1 > U71^12
active1 > U71^12

Status:
U71^12: multiset
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(76) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(77) PisEmptyProof (EQUIVALENT transformation)

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

(78) TRUE

(79) Obligation:

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

U621(active(X)) → U621(X)
U621(mark(X)) → U621(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(80) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(81) Obligation:

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

U621(mark(X)) → U621(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(82) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U621(mark(X)) → U621(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U62^11

Status:
U62^11: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(83) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(84) PisEmptyProof (EQUIVALENT transformation)

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

(85) TRUE

(86) Obligation:

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

U611(X1, mark(X2)) → U611(X1, X2)
U611(mark(X1), X2) → U611(X1, X2)
U611(active(X1), X2) → U611(X1, X2)
U611(X1, active(X2)) → U611(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(88) Obligation:

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

U611(mark(X1), X2) → U611(X1, X2)
U611(active(X1), X2) → U611(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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.


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

Recursive path order with status [RPO].
Precedence:
mark1 > U61^11

Status:
U61^11: multiset
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(90) Obligation:

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

U611(active(X1), X2) → U611(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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.


U611(active(X1), X2) → U611(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
active1 > U61^12

Status:
U61^12: [1,2]
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(92) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(93) PisEmptyProof (EQUIVALENT transformation)

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

(94) TRUE

(95) Obligation:

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

ISNATLIST(active(X)) → ISNATLIST(X)
ISNATLIST(mark(X)) → ISNATLIST(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(96) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(97) Obligation:

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

ISNATLIST(mark(X)) → ISNATLIST(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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.


ISNATLIST(mark(X)) → ISNATLIST(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > ISNATLIST1

Status:
ISNATLIST1: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(99) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(100) PisEmptyProof (EQUIVALENT transformation)

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

(101) TRUE

(102) Obligation:

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

U521(active(X)) → U521(X)
U521(mark(X)) → U521(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(103) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(104) Obligation:

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

U521(mark(X)) → U521(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(105) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U521(mark(X)) → U521(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U52^11

Status:
U52^11: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(106) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(107) PisEmptyProof (EQUIVALENT transformation)

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

(108) TRUE

(109) Obligation:

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

U511(X1, mark(X2)) → U511(X1, X2)
U511(mark(X1), X2) → U511(X1, X2)
U511(active(X1), X2) → U511(X1, X2)
U511(X1, active(X2)) → U511(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(110) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(111) Obligation:

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

U511(mark(X1), X2) → U511(X1, X2)
U511(active(X1), X2) → U511(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(112) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
mark1 > U51^11

Status:
U51^11: multiset
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(113) Obligation:

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

U511(active(X1), X2) → U511(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(114) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U511(active(X1), X2) → U511(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
active1 > U51^12

Status:
U51^12: [1,2]
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(115) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(116) PisEmptyProof (EQUIVALENT transformation)

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

(117) TRUE

(118) Obligation:

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

ISNATILIST(active(X)) → ISNATILIST(X)
ISNATILIST(mark(X)) → ISNATILIST(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(119) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(120) Obligation:

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

ISNATILIST(mark(X)) → ISNATILIST(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(121) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


ISNATILIST(mark(X)) → ISNATILIST(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > ISNATILIST1

Status:
ISNATILIST1: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(122) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(123) PisEmptyProof (EQUIVALENT transformation)

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

(124) TRUE

(125) Obligation:

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

U421(active(X)) → U421(X)
U421(mark(X)) → U421(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(126) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(127) Obligation:

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

U421(mark(X)) → U421(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(128) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U421(mark(X)) → U421(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U42^11

Status:
U42^11: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(129) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(130) PisEmptyProof (EQUIVALENT transformation)

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

(131) TRUE

(132) Obligation:

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

U411(X1, mark(X2)) → U411(X1, X2)
U411(mark(X1), X2) → U411(X1, X2)
U411(active(X1), X2) → U411(X1, X2)
U411(X1, active(X2)) → U411(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(133) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(134) Obligation:

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

U411(mark(X1), X2) → U411(X1, X2)
U411(active(X1), X2) → U411(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(135) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
mark1 > U41^11

Status:
U41^11: multiset
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(136) Obligation:

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

U411(active(X1), X2) → U411(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(137) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U411(active(X1), X2) → U411(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
active1 > U41^12

Status:
U41^12: [1,2]
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(138) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(139) PisEmptyProof (EQUIVALENT transformation)

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

(140) TRUE

(141) Obligation:

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

U311(active(X)) → U311(X)
U311(mark(X)) → U311(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(142) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(143) Obligation:

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

U311(mark(X)) → U311(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(144) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U311(mark(X)) → U311(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U31^11

Status:
U31^11: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(145) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(146) PisEmptyProof (EQUIVALENT transformation)

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

(147) TRUE

(148) Obligation:

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

U211(active(X)) → U211(X)
U211(mark(X)) → U211(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(149) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(150) Obligation:

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

U211(mark(X)) → U211(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(151) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U211(mark(X)) → U211(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U21^11

Status:
U21^11: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(152) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(153) PisEmptyProof (EQUIVALENT transformation)

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

(154) TRUE

(155) Obligation:

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

U111(active(X)) → U111(X)
U111(mark(X)) → U111(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(156) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Recursive path order with status [RPO].
Precedence:
trivial

Status:
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(157) Obligation:

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

U111(mark(X)) → U111(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(158) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U111(mark(X)) → U111(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
mark1 > U11^11

Status:
U11^11: [1]
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(159) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(160) PisEmptyProof (EQUIVALENT transformation)

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

(161) TRUE

(162) Obligation:

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

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

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(163) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


CONS(X1, mark(X2)) → CONS(X1, X2)
CONS(X1, active(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)  =  x2
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)

Recursive path order with status [RPO].
Precedence:
trivial

Status:
mark1: multiset
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(164) Obligation:

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

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

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(165) 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)
active(x1)  =  x1

Recursive path order with status [RPO].
Precedence:
mark1 > CONS1

Status:
CONS1: multiset
mark1: multiset

The following usable rules [FROCOS05] were oriented: none

(166) Obligation:

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

CONS(active(X1), X2) → CONS(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(167) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


CONS(active(X1), X2) → CONS(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:
active1 > CONS2

Status:
CONS2: [1,2]
active1: multiset

The following usable rules [FROCOS05] were oriented: none

(168) Obligation:

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

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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

(169) PisEmptyProof (EQUIVALENT transformation)

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

(170) TRUE

(171) Obligation:

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

MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
ACTIVE(U41(tt, V2)) → MARK(U42(isNatIList(V2)))
MARK(cons(X1, X2)) → MARK(X1)
MARK(zeros) → ACTIVE(zeros)
ACTIVE(zeros) → MARK(cons(0, zeros))
MARK(U11(X)) → ACTIVE(U11(mark(X)))
ACTIVE(U51(tt, V2)) → MARK(U52(isNatList(V2)))
MARK(U11(X)) → MARK(X)
MARK(U21(X)) → ACTIVE(U21(mark(X)))
ACTIVE(U61(tt, V2)) → MARK(U62(isNatIList(V2)))
MARK(U21(X)) → MARK(X)
MARK(U31(X)) → ACTIVE(U31(mark(X)))
ACTIVE(U71(tt, L, N)) → MARK(U72(isNat(N), L))
MARK(U31(X)) → MARK(X)
MARK(U41(X1, X2)) → ACTIVE(U41(mark(X1), X2))
ACTIVE(U72(tt, L)) → MARK(s(length(L)))
MARK(U41(X1, X2)) → MARK(X1)
MARK(U42(X)) → ACTIVE(U42(mark(X)))
ACTIVE(U91(tt, IL, M, N)) → MARK(U92(isNat(M), IL, M, N))
MARK(U42(X)) → MARK(X)
MARK(isNatIList(X)) → ACTIVE(isNatIList(X))
ACTIVE(U92(tt, IL, M, N)) → MARK(U93(isNat(N), IL, M, N))
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(U93(tt, IL, M, N)) → MARK(cons(N, take(M, IL)))
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X)) → ACTIVE(U52(mark(X)))
ACTIVE(isNat(length(V1))) → MARK(U11(isNatList(V1)))
MARK(U52(X)) → MARK(X)
MARK(isNatList(X)) → ACTIVE(isNatList(X))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U61(X1, X2)) → ACTIVE(U61(mark(X1), X2))
ACTIVE(isNatIList(V)) → MARK(U31(isNatList(V)))
MARK(U61(X1, X2)) → MARK(X1)
MARK(U62(X)) → ACTIVE(U62(mark(X)))
ACTIVE(isNatIList(cons(V1, V2))) → MARK(U41(isNat(V1), V2))
MARK(U62(X)) → MARK(X)
MARK(U71(X1, X2, X3)) → ACTIVE(U71(mark(X1), X2, X3))
ACTIVE(isNatList(cons(V1, V2))) → MARK(U51(isNat(V1), V2))
MARK(U71(X1, X2, X3)) → MARK(X1)
MARK(U72(X1, X2)) → ACTIVE(U72(mark(X1), X2))
ACTIVE(isNatList(take(V1, V2))) → MARK(U61(isNat(V1), V2))
MARK(U72(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(length(cons(N, L))) → MARK(U71(isNatList(L), L, N))
MARK(s(X)) → ACTIVE(s(mark(X)))
ACTIVE(take(0, IL)) → MARK(U81(isNatIList(IL)))
MARK(s(X)) → MARK(X)
MARK(length(X)) → ACTIVE(length(mark(X)))
ACTIVE(take(s(M), cons(N, IL))) → MARK(U91(isNatIList(IL), IL, M, N))
MARK(length(X)) → MARK(X)
MARK(U81(X)) → ACTIVE(U81(mark(X)))
MARK(U81(X)) → MARK(X)
MARK(U91(X1, X2, X3, X4)) → ACTIVE(U91(mark(X1), X2, X3, X4))
MARK(U91(X1, X2, X3, X4)) → MARK(X1)
MARK(U92(X1, X2, X3, X4)) → ACTIVE(U92(mark(X1), X2, X3, X4))
MARK(U92(X1, X2, X3, X4)) → MARK(X1)
MARK(U93(X1, X2, X3, X4)) → ACTIVE(U93(mark(X1), X2, X3, X4))
MARK(U93(X1, X2, X3, X4)) → MARK(X1)
MARK(take(X1, X2)) → ACTIVE(take(mark(X1), mark(X2)))
MARK(take(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, V2)) → mark(U62(isNatIList(V2)))
active(U62(tt)) → mark(tt)
active(U71(tt, L, N)) → mark(U72(isNat(N), L))
active(U72(tt, L)) → mark(s(length(L)))
active(U81(tt)) → mark(nil)
active(U91(tt, IL, M, N)) → mark(U92(isNat(M), IL, M, N))
active(U92(tt, IL, M, N)) → mark(U93(isNat(N), IL, M, N))
active(U93(tt, IL, M, N)) → mark(cons(N, take(M, IL)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(isNatList(take(V1, V2))) → mark(U61(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U71(isNatList(L), L, N))
active(take(0, IL)) → mark(U81(isNatIList(IL)))
active(take(s(M), cons(N, IL))) → mark(U91(isNatIList(IL), IL, M, N))
mark(zeros) → active(zeros)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X)) → active(U31(mark(X)))
mark(U41(X1, X2)) → active(U41(mark(X1), X2))
mark(U42(X)) → active(U42(mark(X)))
mark(isNatIList(X)) → active(isNatIList(X))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X)) → active(U52(mark(X)))
mark(isNatList(X)) → active(isNatList(X))
mark(U61(X1, X2)) → active(U61(mark(X1), X2))
mark(U62(X)) → active(U62(mark(X)))
mark(U71(X1, X2, X3)) → active(U71(mark(X1), X2, X3))
mark(U72(X1, X2)) → active(U72(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(s(X)) → active(s(mark(X)))
mark(length(X)) → active(length(mark(X)))
mark(U81(X)) → active(U81(mark(X)))
mark(nil) → active(nil)
mark(U91(X1, X2, X3, X4)) → active(U91(mark(X1), X2, X3, X4))
mark(U92(X1, X2, X3, X4)) → active(U92(mark(X1), X2, X3, X4))
mark(U93(X1, X2, X3, X4)) → active(U93(mark(X1), X2, X3, X4))
mark(take(X1, X2)) → active(take(mark(X1), mark(X2)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X)) → U31(X)
U31(active(X)) → U31(X)
U41(mark(X1), X2) → U41(X1, X2)
U41(X1, mark(X2)) → U41(X1, X2)
U41(active(X1), X2) → U41(X1, X2)
U41(X1, active(X2)) → U41(X1, X2)
U42(mark(X)) → U42(X)
U42(active(X)) → U42(X)
isNatIList(mark(X)) → isNatIList(X)
isNatIList(active(X)) → isNatIList(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X)) → U52(X)
U52(active(X)) → U52(X)
isNatList(mark(X)) → isNatList(X)
isNatList(active(X)) → isNatList(X)
U61(mark(X1), X2) → U61(X1, X2)
U61(X1, mark(X2)) → U61(X1, X2)
U61(active(X1), X2) → U61(X1, X2)
U61(X1, active(X2)) → U61(X1, X2)
U62(mark(X)) → U62(X)
U62(active(X)) → U62(X)
U71(mark(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, mark(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, mark(X3)) → U71(X1, X2, X3)
U71(active(X1), X2, X3) → U71(X1, X2, X3)
U71(X1, active(X2), X3) → U71(X1, X2, X3)
U71(X1, X2, active(X3)) → U71(X1, X2, X3)
U72(mark(X1), X2) → U72(X1, X2)
U72(X1, mark(X2)) → U72(X1, X2)
U72(active(X1), X2) → U72(X1, X2)
U72(X1, active(X2)) → U72(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
length(mark(X)) → length(X)
length(active(X)) → length(X)
U81(mark(X)) → U81(X)
U81(active(X)) → U81(X)
U91(mark(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, mark(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, mark(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, mark(X4)) → U91(X1, X2, X3, X4)
U91(active(X1), X2, X3, X4) → U91(X1, X2, X3, X4)
U91(X1, active(X2), X3, X4) → U91(X1, X2, X3, X4)
U91(X1, X2, active(X3), X4) → U91(X1, X2, X3, X4)
U91(X1, X2, X3, active(X4)) → U91(X1, X2, X3, X4)
U92(mark(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, mark(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, mark(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, mark(X4)) → U92(X1, X2, X3, X4)
U92(active(X1), X2, X3, X4) → U92(X1, X2, X3, X4)
U92(X1, active(X2), X3, X4) → U92(X1, X2, X3, X4)
U92(X1, X2, active(X3), X4) → U92(X1, X2, X3, X4)
U92(X1, X2, X3, active(X4)) → U92(X1, X2, X3, X4)
U93(mark(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, mark(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, mark(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, mark(X4)) → U93(X1, X2, X3, X4)
U93(active(X1), X2, X3, X4) → U93(X1, X2, X3, X4)
U93(X1, active(X2), X3, X4) → U93(X1, X2, X3, X4)
U93(X1, X2, active(X3), X4) → U93(X1, X2, X3, X4)
U93(X1, X2, X3, active(X4)) → U93(X1, X2, X3, X4)
take(mark(X1), X2) → take(X1, X2)
take(X1, mark(X2)) → take(X1, X2)
take(active(X1), X2) → take(X1, X2)
take(X1, active(X2)) → take(X1, X2)

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