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

(0) Obligation:

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

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

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

TAKE₁: multiset
active₁: multiset

The following usable rules [FROCOS05] were oriented: none

(7) 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(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.

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

TAKE₁: [1]
active: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

TAKE(X1, mark(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.

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Recursive path order with status [RPO].
Precedence:

mark₁ > TAKE₂

Status:

TAKE₂: [1,2]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(11) Obligation:

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

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.

(12) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

active₁ > TAKE₂

Status:

active₁: multiset
TAKE₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(13) 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.

(14) PisEmptyProof (EQUIVALENT transformation)

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

(15) TRUE

(16) Obligation:

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

U93¹(X1, mark(X2), X3, X4) → U93¹(X1, X2, X3, X4)
U93¹(mark(X1), 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)

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.

U93¹(X1, X2, mark(X3), X4) → U93¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U93^1₁

Status:

U93^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(18) Obligation:

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

U93¹(X1, mark(X2), X3, X4) → U93¹(X1, X2, X3, X4)
U93¹(mark(X1), X2, 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)

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) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U93¹(X1, X2, active(X3), X4) → U93¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U93^1₁
active₁ > U93^1₁

Status:

active₁: multiset
U93^1₁: [1]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(20) Obligation:

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

U93¹(X1, mark(X2), X3, X4) → U93¹(X1, X2, X3, X4)
U93¹(mark(X1), X2, 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, X3, active(X4)) → U93¹(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.

(21) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U93¹(X1, X2, X3, active(X4)) → U93¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

active₁ > U93^1₁

Status:

active₁: multiset
U93^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(22) Obligation:

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

U93¹(X1, mark(X2), X3, X4) → U93¹(X1, X2, X3, X4)
U93¹(mark(X1), X2, 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)

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.

(23) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U93¹(X1, X2, X3, mark(X4)) → U93¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U93^1₁
active₁ > U93^1₁

Status:

active₁: multiset
U93^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(24) Obligation:

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

U93¹(X1, mark(X2), X3, X4) → U93¹(X1, X2, X3, X4)
U93¹(mark(X1), X2, X3, 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)

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.

(25) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U93¹(mark(X1), X2, X3, X4) → U93¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(26) Obligation:

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

U93¹(X1, mark(X2), X3, 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)

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.

(27) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U93¹(X1, mark(X2), X3, X4) → U93¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

U93^1₂: [1,2]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(28) Obligation:

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

U93¹(active(X1), X2, X3, X4) → U93¹(X1, X2, X3, X4)
U93¹(X1, active(X2), X3, X4) → U93¹(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.

U93¹(X1, active(X2), X3, X4) → U93¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

active₁ > U93^1₂

Status:

active₁: multiset
U93^1₂: multiset

The following usable rules [FROCOS05] were oriented: none

(30) Obligation:

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

U93¹(active(X1), X2, X3, X4) → U93¹(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.

U93¹(active(X1), X2, X3, X4) → U93¹(X1, X2, X3, X4)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U93^1₄: 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:

U92¹(X1, mark(X2), X3, X4) → U92¹(X1, X2, X3, X4)
U92¹(mark(X1), 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)

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.

U92¹(X1, X2, mark(X3), X4) → U92¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U92^1₁

Status:

mark₁: multiset
U92^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(37) Obligation:

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

U92¹(X1, mark(X2), X3, X4) → U92¹(X1, X2, X3, X4)
U92¹(mark(X1), X2, 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)

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.

U92¹(X1, X2, active(X3), X4) → U92¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U92^1₁
active₁ > U92^1₁

Status:

active₁: multiset
mark₁: multiset
U92^1₁: [1]

The following usable rules [FROCOS05] were oriented: none

(39) Obligation:

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

U92¹(X1, mark(X2), X3, X4) → U92¹(X1, X2, X3, X4)
U92¹(mark(X1), X2, 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, X3, active(X4)) → U92¹(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.

(40) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U92¹(X1, X2, X3, active(X4)) → U92¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

active₁ > U92^1₁

Status:

active₁: multiset
U92^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(41) Obligation:

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

U92¹(X1, mark(X2), X3, X4) → U92¹(X1, X2, X3, X4)
U92¹(mark(X1), X2, 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)

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.

(42) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U92¹(X1, X2, X3, mark(X4)) → U92¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U92^1₁
active₁ > U92^1₁

Status:

active₁: multiset
mark₁: multiset
U92^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(43) Obligation:

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

U92¹(X1, mark(X2), X3, X4) → U92¹(X1, X2, X3, X4)
U92¹(mark(X1), X2, X3, 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)

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.

(44) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U92¹(mark(X1), X2, X3, X4) → U92¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(45) Obligation:

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

U92¹(X1, mark(X2), X3, 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)

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.

(46) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U92¹(X1, mark(X2), X3, X4) → U92¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

mark₁: multiset
U92^1₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(47) Obligation:

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

U92¹(active(X1), X2, X3, X4) → U92¹(X1, X2, X3, X4)
U92¹(X1, active(X2), X3, X4) → U92¹(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.

(48) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U92¹(X1, active(X2), X3, X4) → U92¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

active₁ > U92^1₂

Status:

active₁: multiset
U92^1₂: multiset

The following usable rules [FROCOS05] were oriented: none

(49) Obligation:

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

U92¹(active(X1), X2, X3, X4) → U92¹(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.

(50) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U92¹(active(X1), X2, X3, X4) → U92¹(X1, X2, X3, X4)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U92^1₄: multiset

The following usable rules [FROCOS05] were oriented: none

(51) 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.

(52) PisEmptyProof (EQUIVALENT transformation)

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

(53) TRUE

(54) Obligation:

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

U91¹(X1, mark(X2), X3, X4) → U91¹(X1, X2, X3, X4)
U91¹(mark(X1), 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)

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.

(55) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U91¹(X1, X2, mark(X3), X4) → U91¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U91^1₁

Status:

U91^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(56) Obligation:

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

U91¹(X1, mark(X2), X3, X4) → U91¹(X1, X2, X3, X4)
U91¹(mark(X1), X2, 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)

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.

U91¹(X1, X2, active(X3), X4) → U91¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U91^1₁
active₁ > U91^1₁

Status:

active₁: multiset
U91^1₁: [1]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(58) Obligation:

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

U91¹(X1, mark(X2), X3, X4) → U91¹(X1, X2, X3, X4)
U91¹(mark(X1), X2, 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, X3, active(X4)) → U91¹(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.

(59) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U91¹(X1, X2, X3, active(X4)) → U91¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

active₁ > U91^1₁

Status:

active₁: multiset
U91^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(60) Obligation:

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

U91¹(X1, mark(X2), X3, X4) → U91¹(X1, X2, X3, X4)
U91¹(mark(X1), X2, 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)

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) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U91¹(X1, X2, X3, mark(X4)) → U91¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U91^1₁
active₁ > U91^1₁

Status:

active₁: multiset
U91^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(62) Obligation:

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

U91¹(X1, mark(X2), X3, X4) → U91¹(X1, X2, X3, X4)
U91¹(mark(X1), X2, X3, 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)

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.

(63) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U91¹(mark(X1), X2, X3, X4) → U91¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(64) Obligation:

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

U91¹(X1, mark(X2), X3, 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)

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.

(65) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U91¹(X1, mark(X2), X3, X4) → U91¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

U91^1₂: [1,2]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(66) Obligation:

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

U91¹(active(X1), X2, X3, X4) → U91¹(X1, X2, X3, X4)
U91¹(X1, active(X2), X3, X4) → U91¹(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.

(67) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U91¹(X1, active(X2), X3, X4) → U91¹(X1, X2, X3, X4)

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

Recursive path order with status [RPO].
Precedence:

active₁ > U91^1₂

Status:

active₁: multiset
U91^1₂: multiset

The following usable rules [FROCOS05] were oriented: none

(68) Obligation:

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

U91¹(active(X1), X2, X3, X4) → U91¹(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.

(69) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U91¹(active(X1), X2, X3, X4) → U91¹(X1, X2, X3, X4)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U91^1₄: multiset

The following usable rules [FROCOS05] were oriented: none

(70) 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.

(71) PisEmptyProof (EQUIVALENT transformation)

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

(72) TRUE

(73) Obligation:

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

U81¹(active(X)) → U81¹(X)
U81¹(mark(X)) → U81¹(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.

(74) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U81¹(active(X)) → U81¹(X)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U81^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(75) Obligation:

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

U81¹(mark(X)) → U81¹(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.

(76) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U81¹(mark(X)) → U81¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

mark₁ > U81^1₁

Status:

U81^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(77) Obligation:

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

active(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.

(78) PisEmptyProof (EQUIVALENT transformation)

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

(79) TRUE

(80) Obligation:

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

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.

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
LENGTH₁: multiset

The following usable rules [FROCOS05] were oriented: none

(82) 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.

(83) 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:

mark₁ > LENGTH₁

Status:

LENGTH₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(84) 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.

(85) PisEmptyProof (EQUIVALENT transformation)

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

(86) TRUE

(87) 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.

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
S₁: multiset

The following usable rules [FROCOS05] were oriented: none

(89) 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.

(90) 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:

mark₁ > S₁

Status:

mark₁: multiset
S₁: multiset

The following usable rules [FROCOS05] were oriented: none

(91) 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.

(92) PisEmptyProof (EQUIVALENT transformation)

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

(93) TRUE

(94) 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.

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
ISNAT₁: multiset

The following usable rules [FROCOS05] were oriented: none

(96) 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.

(97) 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:

mark₁ > ISNAT₁

Status:

mark₁: multiset
ISNAT₁: multiset

The following usable rules [FROCOS05] were oriented: none

(98) 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.

(99) PisEmptyProof (EQUIVALENT transformation)

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

(100) TRUE

(101) Obligation:

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

U72¹(X1, mark(X2)) → U72¹(X1, X2)
U72¹(mark(X1), X2) → U72¹(X1, X2)
U72¹(active(X1), X2) → U72¹(X1, X2)
U72¹(X1, active(X2)) → U72¹(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.

(102) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U72¹(active(X1), X2) → U72¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U72^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(103) Obligation:

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

U72¹(X1, mark(X2)) → U72¹(X1, X2)
U72¹(mark(X1), X2) → U72¹(X1, X2)
U72¹(X1, active(X2)) → U72¹(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.

(104) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U72¹(mark(X1), X2) → U72¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active: multiset
mark₁: multiset
U72^1₁: [1]

The following usable rules [FROCOS05] were oriented: none

(105) Obligation:

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

U72¹(X1, mark(X2)) → U72¹(X1, X2)
U72¹(X1, active(X2)) → U72¹(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.

(106) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U72¹(X1, mark(X2)) → U72¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U72^1₂

Status:

mark₁: multiset
U72^1₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(107) Obligation:

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

U72¹(X1, active(X2)) → U72¹(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.

(108) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U72¹(X1, active(X2)) → U72¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

active₁ > U72^1₂

Status:

active₁: multiset
U72^1₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(109) 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.

(110) PisEmptyProof (EQUIVALENT transformation)

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

(111) TRUE

(112) Obligation:

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

U71¹(X1, mark(X2), X3) → U71¹(X1, X2, X3)
U71¹(mark(X1), 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)

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.

(113) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U71¹(X1, active(X2), X3) → U71¹(X1, X2, X3)

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

Recursive path order with status [RPO].
Precedence:

active₁ > U71^1₁

Status:

active₁: multiset
U71^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(114) Obligation:

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

U71¹(X1, mark(X2), X3) → U71¹(X1, X2, X3)
U71¹(mark(X1), 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, X2, active(X3)) → U71¹(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.

(115) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U71¹(X1, mark(X2), X3) → U71¹(X1, X2, X3)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U71^1₁
active₁ > U71^1₁

Status:

active₁: multiset
U71^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(116) Obligation:

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

U71¹(mark(X1), 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, X2, active(X3)) → U71¹(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.

(117) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U71¹(X1, X2, mark(X3)) → U71¹(X1, X2, X3)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

U71^1₁: [1]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(118) Obligation:

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

U71¹(mark(X1), X2, X3) → U71¹(X1, X2, X3)
U71¹(active(X1), X2, X3) → U71¹(X1, X2, X3)
U71¹(X1, X2, active(X3)) → U71¹(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.

(119) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U71¹(X1, X2, active(X3)) → U71¹(X1, X2, X3)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U71^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(120) Obligation:

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

U71¹(mark(X1), X2, X3) → U71¹(X1, X2, X3)
U71¹(active(X1), X2, X3) → U71¹(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.

(121) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U71¹(active(X1), X2, X3) → U71¹(X1, X2, X3)

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

Recursive path order with status [RPO].
Precedence:

active₁ > U71^1₁

Status:

active₁: multiset
U71^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(122) Obligation:

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

U71¹(mark(X1), X2, X3) → U71¹(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.

(123) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U71¹(mark(X1), X2, X3) → U71¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

trivial

Status:

U71^1₃: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(124) 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.

(125) PisEmptyProof (EQUIVALENT transformation)

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

(126) TRUE

(127) Obligation:

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

U62¹(active(X)) → U62¹(X)
U62¹(mark(X)) → U62¹(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.

U62¹(active(X)) → U62¹(X)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U62^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(129) Obligation:

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

U62¹(mark(X)) → U62¹(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.

(130) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U62¹(mark(X)) → U62¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

mark₁ > U62^1₁

Status:

mark₁: multiset
U62^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(131) 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.

(132) PisEmptyProof (EQUIVALENT transformation)

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

(133) TRUE

(134) Obligation:

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

U61¹(X1, mark(X2)) → U61¹(X1, X2)
U61¹(mark(X1), X2) → U61¹(X1, X2)
U61¹(active(X1), X2) → U61¹(X1, X2)
U61¹(X1, active(X2)) → U61¹(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.

U61¹(active(X1), X2) → U61¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U61^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(136) Obligation:

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

U61¹(X1, mark(X2)) → U61¹(X1, X2)
U61¹(mark(X1), X2) → U61¹(X1, X2)
U61¹(X1, active(X2)) → U61¹(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.

U61¹(mark(X1), X2) → U61¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active: multiset
U61^1₁: [1]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(138) Obligation:

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

U61¹(X1, mark(X2)) → U61¹(X1, X2)
U61¹(X1, active(X2)) → U61¹(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.

(139) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(X1, mark(X2)) → U61¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U61^1₂

Status:

U61^1₂: [1,2]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(140) Obligation:

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

U61¹(X1, active(X2)) → U61¹(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.

(141) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(X1, active(X2)) → U61¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

active₁ > U61^1₂

Status:

active₁: multiset
U61^1₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(142) 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.

(143) PisEmptyProof (EQUIVALENT transformation)

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

(144) TRUE

(145) 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.

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
ISNATLIST₁: multiset

The following usable rules [FROCOS05] were oriented: none

(147) 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.

(148) 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:

mark₁ > ISNATLIST₁

Status:

ISNATLIST₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(149) 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.

(150) PisEmptyProof (EQUIVALENT transformation)

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

(151) TRUE

(152) Obligation:

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

U52¹(active(X)) → U52¹(X)
U52¹(mark(X)) → U52¹(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.

(153) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U52¹(active(X)) → U52¹(X)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

U52^1₁: multiset
active₁: multiset

The following usable rules [FROCOS05] were oriented: none

(154) Obligation:

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

U52¹(mark(X)) → U52¹(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.

(155) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U52¹(mark(X)) → U52¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

mark₁ > U52^1₁

Status:

U52^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(156) 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.

(157) PisEmptyProof (EQUIVALENT transformation)

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

(158) TRUE

(159) Obligation:

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

U51¹(X1, mark(X2)) → U51¹(X1, X2)
U51¹(mark(X1), X2) → U51¹(X1, X2)
U51¹(active(X1), X2) → U51¹(X1, X2)
U51¹(X1, active(X2)) → U51¹(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.

(160) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(active(X1), X2) → U51¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U51^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(161) Obligation:

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

U51¹(X1, mark(X2)) → U51¹(X1, X2)
U51¹(mark(X1), X2) → U51¹(X1, X2)
U51¹(X1, active(X2)) → U51¹(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.

(162) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(mark(X1), X2) → U51¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active: multiset
mark₁: multiset
U51^1₁: [1]

The following usable rules [FROCOS05] were oriented: none

(163) Obligation:

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

U51¹(X1, mark(X2)) → U51¹(X1, X2)
U51¹(X1, active(X2)) → U51¹(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.

(164) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(X1, mark(X2)) → U51¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U51^1₂

Status:

U51^1₂: [1,2]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(165) Obligation:

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

U51¹(X1, active(X2)) → U51¹(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.

(166) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(X1, active(X2)) → U51¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

active₁ > U51^1₂

Status:

active₁: multiset
U51^1₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(167) 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.

(168) PisEmptyProof (EQUIVALENT transformation)

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

(169) TRUE

(170) 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.

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
ISNATILIST₁: multiset

The following usable rules [FROCOS05] were oriented: none

(172) 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.

(173) 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:

mark₁ > ISNATILIST₁

Status:

ISNATILIST₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(174) 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.

(175) PisEmptyProof (EQUIVALENT transformation)

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

(176) TRUE

(177) Obligation:

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

U42¹(active(X)) → U42¹(X)
U42¹(mark(X)) → U42¹(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.

(178) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U42¹(active(X)) → U42¹(X)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U42^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(179) Obligation:

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

U42¹(mark(X)) → U42¹(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.

(180) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U42¹(mark(X)) → U42¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

mark₁ > U42^1₁

Status:

mark₁: multiset
U42^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(181) 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.

(182) PisEmptyProof (EQUIVALENT transformation)

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

(183) TRUE

(184) Obligation:

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

U41¹(X1, mark(X2)) → U41¹(X1, X2)
U41¹(mark(X1), X2) → U41¹(X1, X2)
U41¹(active(X1), X2) → U41¹(X1, X2)
U41¹(X1, active(X2)) → U41¹(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.

(185) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U41¹(active(X1), X2) → U41¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U41^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(186) Obligation:

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

U41¹(X1, mark(X2)) → U41¹(X1, X2)
U41¹(mark(X1), X2) → U41¹(X1, X2)
U41¹(X1, active(X2)) → U41¹(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.

(187) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U41¹(mark(X1), X2) → U41¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active: multiset
U41^1₁: [1]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(188) Obligation:

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

U41¹(X1, mark(X2)) → U41¹(X1, X2)
U41¹(X1, active(X2)) → U41¹(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.

(189) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U41¹(X1, mark(X2)) → U41¹(X1, X2)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > U41^1₂

Status:

U41^1₂: [1,2]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(190) Obligation:

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

U41¹(X1, active(X2)) → U41¹(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.

(191) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U41¹(X1, active(X2)) → U41¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

active₁ > U41^1₂

Status:

active₁: multiset
U41^1₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(192) 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.

(193) PisEmptyProof (EQUIVALENT transformation)

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

(194) TRUE

(195) Obligation:

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

U31¹(active(X)) → U31¹(X)
U31¹(mark(X)) → U31¹(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.

(196) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U31¹(active(X)) → U31¹(X)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U31^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(197) Obligation:

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

U31¹(mark(X)) → U31¹(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.

(198) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U31¹(mark(X)) → U31¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

mark₁ > U31^1₁

Status:

U31^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(199) 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.

(200) PisEmptyProof (EQUIVALENT transformation)

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

(201) TRUE

(202) Obligation:

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

U21¹(active(X)) → U21¹(X)
U21¹(mark(X)) → U21¹(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.

(203) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U21¹(active(X)) → U21¹(X)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U21^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(204) Obligation:

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

U21¹(mark(X)) → U21¹(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.

(205) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U21¹(mark(X)) → U21¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

mark₁ > U21^1₁

Status:

mark₁: multiset
U21^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(206) 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.

(207) PisEmptyProof (EQUIVALENT transformation)

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

(208) TRUE

(209) Obligation:

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

U11¹(active(X)) → U11¹(X)
U11¹(mark(X)) → U11¹(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.

(210) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(active(X)) → U11¹(X)

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
U11^1₁: multiset

The following usable rules [FROCOS05] were oriented: none

(211) Obligation:

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

U11¹(mark(X)) → U11¹(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.

(212) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(mark(X)) → U11¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

mark₁ > U11^1₁

Status:

U11^1₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(213) 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.

(214) PisEmptyProof (EQUIVALENT transformation)

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

(215) TRUE

(216) 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.

(217) 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: Combined order from the following AFS and order.
CONS(x1, x2)  =  CONS(x1)
mark(x1)  =  x1
active(x1)  =  active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active₁: multiset
CONS₁: multiset

The following usable rules [FROCOS05] were oriented: none

(218) 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(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.

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

Recursive path order with status [RPO].
Precedence:

trivial

Status:

active: multiset
CONS₁: [1]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(220) Obligation:

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

CONS(X1, mark(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.

(221) 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)

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

Recursive path order with status [RPO].
Precedence:

mark₁ > CONS₂

Status:

CONS₂: [1,2]
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(222) Obligation:

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

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.

(223) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Precedence:

active₁ > CONS₂

Status:

active₁: multiset
CONS₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(224) 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.

(225) PisEmptyProof (EQUIVALENT transformation)

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

(226) TRUE

(227) 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.