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(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

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

(2) Obligation:

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

ACTIVE(U11(tt, N, XS)) → U12¹(tt, N, XS)
ACTIVE(U12(tt, N, XS)) → SND(splitAt(N, XS))
ACTIVE(U12(tt, N, XS)) → SPLITAT(N, XS)
ACTIVE(U21(tt, X)) → U22¹(tt, X)
ACTIVE(U31(tt, N)) → U32¹(tt, N)
ACTIVE(U41(tt, N, XS)) → U42¹(tt, N, XS)
ACTIVE(U42(tt, N, XS)) → HEAD(afterNth(N, XS))
ACTIVE(U42(tt, N, XS)) → AFTERNTH(N, XS)
ACTIVE(U51(tt, Y)) → U52¹(tt, Y)
ACTIVE(U61(tt, N, X, XS)) → U62¹(tt, N, X, XS)
ACTIVE(U62(tt, N, X, XS)) → U63¹(tt, N, X, XS)
ACTIVE(U63(tt, N, X, XS)) → U64¹(splitAt(N, XS), X)
ACTIVE(U63(tt, N, X, XS)) → SPLITAT(N, XS)
ACTIVE(U64(pair(YS, ZS), X)) → PAIR(cons(X, YS), ZS)
ACTIVE(U64(pair(YS, ZS), X)) → CONS(X, YS)
ACTIVE(U71(tt, XS)) → U72¹(tt, XS)
ACTIVE(U81(tt, N, XS)) → U82¹(tt, N, XS)
ACTIVE(U82(tt, N, XS)) → FST(splitAt(N, XS))
ACTIVE(U82(tt, N, XS)) → SPLITAT(N, XS)
ACTIVE(afterNth(N, XS)) → U11¹(tt, N, XS)
ACTIVE(fst(pair(X, Y))) → U21¹(tt, X)
ACTIVE(head(cons(N, XS))) → U31¹(tt, N)
ACTIVE(natsFrom(N)) → CONS(N, natsFrom(s(N)))
ACTIVE(natsFrom(N)) → NATSFROM(s(N))
ACTIVE(natsFrom(N)) → S(N)
ACTIVE(sel(N, XS)) → U41¹(tt, N, XS)
ACTIVE(snd(pair(X, Y))) → U51¹(tt, Y)
ACTIVE(splitAt(0, XS)) → PAIR(nil, XS)
ACTIVE(splitAt(s(N), cons(X, XS))) → U61¹(tt, N, X, XS)
ACTIVE(tail(cons(N, XS))) → U71¹(tt, XS)
ACTIVE(take(N, XS)) → U81¹(tt, N, XS)
ACTIVE(U11(X1, X2, X3)) → U11¹(active(X1), X2, X3)
ACTIVE(U11(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U12(X1, X2, X3)) → U12¹(active(X1), X2, X3)
ACTIVE(U12(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(snd(X)) → SND(active(X))
ACTIVE(snd(X)) → ACTIVE(X)
ACTIVE(splitAt(X1, X2)) → SPLITAT(active(X1), X2)
ACTIVE(splitAt(X1, X2)) → ACTIVE(X1)
ACTIVE(splitAt(X1, X2)) → SPLITAT(X1, active(X2))
ACTIVE(splitAt(X1, X2)) → ACTIVE(X2)
ACTIVE(U21(X1, X2)) → U21¹(active(X1), X2)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U22(X1, X2)) → U22¹(active(X1), X2)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U31(X1, X2)) → U31¹(active(X1), X2)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X1, X2)) → U32¹(active(X1), X2)
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
ACTIVE(U41(X1, X2, X3)) → U41¹(active(X1), X2, X3)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → U42¹(active(X1), X2, X3)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(head(X)) → HEAD(active(X))
ACTIVE(head(X)) → ACTIVE(X)
ACTIVE(afterNth(X1, X2)) → AFTERNTH(active(X1), X2)
ACTIVE(afterNth(X1, X2)) → ACTIVE(X1)
ACTIVE(afterNth(X1, X2)) → AFTERNTH(X1, active(X2))
ACTIVE(afterNth(X1, X2)) → ACTIVE(X2)
ACTIVE(U51(X1, X2)) → U51¹(active(X1), X2)
ACTIVE(U51(X1, X2)) → ACTIVE(X1)
ACTIVE(U52(X1, X2)) → U52¹(active(X1), X2)
ACTIVE(U52(X1, X2)) → ACTIVE(X1)
ACTIVE(U61(X1, X2, X3, X4)) → U61¹(active(X1), X2, X3, X4)
ACTIVE(U61(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(U62(X1, X2, X3, X4)) → U62¹(active(X1), X2, X3, X4)
ACTIVE(U62(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(U63(X1, X2, X3, X4)) → U63¹(active(X1), X2, X3, X4)
ACTIVE(U63(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(U64(X1, X2)) → U64¹(active(X1), X2)
ACTIVE(U64(X1, X2)) → ACTIVE(X1)
ACTIVE(pair(X1, X2)) → PAIR(active(X1), X2)
ACTIVE(pair(X1, X2)) → ACTIVE(X1)
ACTIVE(pair(X1, X2)) → PAIR(X1, active(X2))
ACTIVE(pair(X1, X2)) → ACTIVE(X2)
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(U71(X1, X2)) → U71¹(active(X1), X2)
ACTIVE(U71(X1, X2)) → ACTIVE(X1)
ACTIVE(U72(X1, X2)) → U72¹(active(X1), X2)
ACTIVE(U72(X1, X2)) → ACTIVE(X1)
ACTIVE(U81(X1, X2, X3)) → U81¹(active(X1), X2, X3)
ACTIVE(U81(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U82(X1, X2, X3)) → U82¹(active(X1), X2, X3)
ACTIVE(U82(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(fst(X)) → FST(active(X))
ACTIVE(fst(X)) → ACTIVE(X)
ACTIVE(natsFrom(X)) → NATSFROM(active(X))
ACTIVE(natsFrom(X)) → ACTIVE(X)
ACTIVE(s(X)) → S(active(X))
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(sel(X1, X2)) → SEL(active(X1), X2)
ACTIVE(sel(X1, X2)) → ACTIVE(X1)
ACTIVE(sel(X1, X2)) → SEL(X1, active(X2))
ACTIVE(sel(X1, X2)) → ACTIVE(X2)
ACTIVE(tail(X)) → TAIL(active(X))
ACTIVE(tail(X)) → ACTIVE(X)
ACTIVE(take(X1, X2)) → TAKE(active(X1), X2)
ACTIVE(take(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → TAKE(X1, active(X2))
ACTIVE(take(X1, X2)) → ACTIVE(X2)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
SND(mark(X)) → SND(X)
SPLITAT(mark(X1), X2) → SPLITAT(X1, X2)
SPLITAT(X1, mark(X2)) → SPLITAT(X1, X2)
U21¹(mark(X1), X2) → U21¹(X1, X2)
U22¹(mark(X1), X2) → U22¹(X1, X2)
U31¹(mark(X1), X2) → U31¹(X1, X2)
U32¹(mark(X1), X2) → U32¹(X1, X2)
U41¹(mark(X1), X2, X3) → U41¹(X1, X2, X3)
U42¹(mark(X1), X2, X3) → U42¹(X1, X2, X3)
HEAD(mark(X)) → HEAD(X)
AFTERNTH(mark(X1), X2) → AFTERNTH(X1, X2)
AFTERNTH(X1, mark(X2)) → AFTERNTH(X1, X2)
U51¹(mark(X1), X2) → U51¹(X1, X2)
U52¹(mark(X1), X2) → U52¹(X1, X2)
U61¹(mark(X1), X2, X3, X4) → U61¹(X1, X2, X3, X4)
U62¹(mark(X1), X2, X3, X4) → U62¹(X1, X2, X3, X4)
U63¹(mark(X1), X2, X3, X4) → U63¹(X1, X2, X3, X4)
U64¹(mark(X1), X2) → U64¹(X1, X2)
PAIR(mark(X1), X2) → PAIR(X1, X2)
PAIR(X1, mark(X2)) → PAIR(X1, X2)
CONS(mark(X1), X2) → CONS(X1, X2)
U71¹(mark(X1), X2) → U71¹(X1, X2)
U72¹(mark(X1), X2) → U72¹(X1, X2)
U81¹(mark(X1), X2, X3) → U81¹(X1, X2, X3)
U82¹(mark(X1), X2, X3) → U82¹(X1, X2, X3)
FST(mark(X)) → FST(X)
NATSFROM(mark(X)) → NATSFROM(X)
S(mark(X)) → S(X)
SEL(mark(X1), X2) → SEL(X1, X2)
SEL(X1, mark(X2)) → SEL(X1, X2)
TAIL(mark(X)) → TAIL(X)
TAKE(mark(X1), X2) → TAKE(X1, X2)
TAKE(X1, mark(X2)) → TAKE(X1, X2)
PROPER(U11(X1, X2, X3)) → U11¹(proper(X1), proper(X2), proper(X3))
PROPER(U11(X1, X2, X3)) → PROPER(X1)
PROPER(U11(X1, X2, X3)) → PROPER(X2)
PROPER(U11(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2, X3)) → U12¹(proper(X1), proper(X2), proper(X3))
PROPER(U12(X1, X2, X3)) → PROPER(X1)
PROPER(U12(X1, X2, X3)) → PROPER(X2)
PROPER(U12(X1, X2, X3)) → PROPER(X3)
PROPER(snd(X)) → SND(proper(X))
PROPER(snd(X)) → PROPER(X)
PROPER(splitAt(X1, X2)) → SPLITAT(proper(X1), proper(X2))
PROPER(splitAt(X1, X2)) → PROPER(X1)
PROPER(splitAt(X1, X2)) → PROPER(X2)
PROPER(U21(X1, X2)) → U21¹(proper(X1), proper(X2))
PROPER(U21(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2)) → PROPER(X2)
PROPER(U22(X1, X2)) → U22¹(proper(X1), proper(X2))
PROPER(U22(X1, X2)) → PROPER(X1)
PROPER(U22(X1, X2)) → PROPER(X2)
PROPER(U31(X1, X2)) → U31¹(proper(X1), proper(X2))
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U32(X1, X2)) → U32¹(proper(X1), proper(X2))
PROPER(U32(X1, X2)) → PROPER(X1)
PROPER(U32(X1, X2)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → U41¹(proper(X1), proper(X2), proper(X3))
PROPER(U41(X1, X2, X3)) → PROPER(X1)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X3)
PROPER(U42(X1, X2, X3)) → U42¹(proper(X1), proper(X2), proper(X3))
PROPER(U42(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
PROPER(U42(X1, X2, X3)) → PROPER(X3)
PROPER(head(X)) → HEAD(proper(X))
PROPER(head(X)) → PROPER(X)
PROPER(afterNth(X1, X2)) → AFTERNTH(proper(X1), proper(X2))
PROPER(afterNth(X1, X2)) → PROPER(X1)
PROPER(afterNth(X1, X2)) → PROPER(X2)
PROPER(U51(X1, X2)) → U51¹(proper(X1), proper(X2))
PROPER(U51(X1, X2)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X2)
PROPER(U52(X1, X2)) → U52¹(proper(X1), proper(X2))
PROPER(U52(X1, X2)) → PROPER(X1)
PROPER(U52(X1, X2)) → PROPER(X2)
PROPER(U61(X1, X2, X3, X4)) → U61¹(proper(X1), proper(X2), proper(X3), proper(X4))
PROPER(U61(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U62(X1, X2, X3, X4)) → U62¹(proper(X1), proper(X2), proper(X3), proper(X4))
PROPER(U62(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U63(X1, X2, X3, X4)) → U63¹(proper(X1), proper(X2), proper(X3), proper(X4))
PROPER(U63(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U64(X1, X2)) → U64¹(proper(X1), proper(X2))
PROPER(U64(X1, X2)) → PROPER(X1)
PROPER(U64(X1, X2)) → PROPER(X2)
PROPER(pair(X1, X2)) → PAIR(proper(X1), proper(X2))
PROPER(pair(X1, X2)) → PROPER(X1)
PROPER(pair(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(U71(X1, X2)) → U71¹(proper(X1), proper(X2))
PROPER(U71(X1, X2)) → PROPER(X1)
PROPER(U71(X1, X2)) → PROPER(X2)
PROPER(U72(X1, X2)) → U72¹(proper(X1), proper(X2))
PROPER(U72(X1, X2)) → PROPER(X1)
PROPER(U72(X1, X2)) → PROPER(X2)
PROPER(U81(X1, X2, X3)) → U81¹(proper(X1), proper(X2), proper(X3))
PROPER(U81(X1, X2, X3)) → PROPER(X1)
PROPER(U81(X1, X2, X3)) → PROPER(X2)
PROPER(U81(X1, X2, X3)) → PROPER(X3)
PROPER(U82(X1, X2, X3)) → U82¹(proper(X1), proper(X2), proper(X3))
PROPER(U82(X1, X2, X3)) → PROPER(X1)
PROPER(U82(X1, X2, X3)) → PROPER(X2)
PROPER(U82(X1, X2, X3)) → PROPER(X3)
PROPER(fst(X)) → FST(proper(X))
PROPER(fst(X)) → PROPER(X)
PROPER(natsFrom(X)) → NATSFROM(proper(X))
PROPER(natsFrom(X)) → PROPER(X)
PROPER(s(X)) → S(proper(X))
PROPER(s(X)) → PROPER(X)
PROPER(sel(X1, X2)) → SEL(proper(X1), proper(X2))
PROPER(sel(X1, X2)) → PROPER(X1)
PROPER(sel(X1, X2)) → PROPER(X2)
PROPER(tail(X)) → TAIL(proper(X))
PROPER(tail(X)) → PROPER(X)
PROPER(take(X1, X2)) → TAKE(proper(X1), proper(X2))
PROPER(take(X1, X2)) → PROPER(X1)
PROPER(take(X1, X2)) → PROPER(X2)
U11¹(ok(X1), ok(X2), ok(X3)) → U11¹(X1, X2, X3)
U12¹(ok(X1), ok(X2), ok(X3)) → U12¹(X1, X2, X3)
SND(ok(X)) → SND(X)
SPLITAT(ok(X1), ok(X2)) → SPLITAT(X1, X2)
U21¹(ok(X1), ok(X2)) → U21¹(X1, X2)
U22¹(ok(X1), ok(X2)) → U22¹(X1, X2)
U31¹(ok(X1), ok(X2)) → U31¹(X1, X2)
U32¹(ok(X1), ok(X2)) → U32¹(X1, X2)
U41¹(ok(X1), ok(X2), ok(X3)) → U41¹(X1, X2, X3)
U42¹(ok(X1), ok(X2), ok(X3)) → U42¹(X1, X2, X3)
HEAD(ok(X)) → HEAD(X)
AFTERNTH(ok(X1), ok(X2)) → AFTERNTH(X1, X2)
U51¹(ok(X1), ok(X2)) → U51¹(X1, X2)
U52¹(ok(X1), ok(X2)) → U52¹(X1, X2)
U61¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U61¹(X1, X2, X3, X4)
U62¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U62¹(X1, X2, X3, X4)
U63¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U63¹(X1, X2, X3, X4)
U64¹(ok(X1), ok(X2)) → U64¹(X1, X2)
PAIR(ok(X1), ok(X2)) → PAIR(X1, X2)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
U71¹(ok(X1), ok(X2)) → U71¹(X1, X2)
U72¹(ok(X1), ok(X2)) → U72¹(X1, X2)
U81¹(ok(X1), ok(X2), ok(X3)) → U81¹(X1, X2, X3)
U82¹(ok(X1), ok(X2), ok(X3)) → U82¹(X1, X2, X3)
FST(ok(X)) → FST(X)
NATSFROM(ok(X)) → NATSFROM(X)
S(ok(X)) → S(X)
SEL(ok(X1), ok(X2)) → SEL(X1, X2)
TAIL(ok(X)) → TAIL(X)
TAKE(ok(X1), ok(X2)) → TAKE(X1, X2)
TOP(mark(X)) → TOP(proper(X))
TOP(mark(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
TOP(ok(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 33 SCCs with 98 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(ok(X1), ok(X2)) → TAKE(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

[TAKE₁, mark₁]

Status:

TAKE₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[TAKE₂, ok₁]

Status:

TAKE₂: [1,2]
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(11) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(12) PisEmptyProof (EQUIVALENT transformation)

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

(13) TRUE

(14) Obligation:

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

TAIL(ok(X)) → TAIL(X)
TAIL(mark(X)) → TAIL(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

TAIL(ok(X)) → TAIL(X)

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

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

[TAIL₁, ok₁]

Status:

ok₁: multiset
TAIL₁: [1]

The following usable rules [FROCOS05] were oriented: none

(16) Obligation:

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

TAIL(mark(X)) → TAIL(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(17) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

TAIL(mark(X)) → TAIL(X)

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

mark₁ > TAIL₁

Status:

mark₁: multiset
TAIL₁: multiset

The following usable rules [FROCOS05] were oriented: none

(18) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(19) PisEmptyProof (EQUIVALENT transformation)

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

(20) TRUE

(21) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SEL(X1, mark(X2)) → SEL(X1, X2)

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

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

[SEL₁, mark₁]

Status:

mark₁: multiset
SEL₁: multiset

The following usable rules [FROCOS05] were oriented: none

(23) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(24) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SEL(mark(X1), X2) → SEL(X1, X2)

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

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

trivial

Status:

mark₁: [1]
SEL₂: [2,1]

The following usable rules [FROCOS05] were oriented: none

(25) Obligation:

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

SEL(ok(X1), ok(X2)) → SEL(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(26) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SEL(ok(X1), ok(X2)) → SEL(X1, X2)

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

[SEL₂, ok₁]

Status:

ok₁: [1]
SEL₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(27) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(28) PisEmptyProof (EQUIVALENT transformation)

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

(29) TRUE

(30) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(31) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

[S₁, ok₁]

Status:

ok₁: multiset
S₁: [1]

The following usable rules [FROCOS05] were oriented: none

(32) 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(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(33) 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].
Quasi-Precedence:

mark₁ > S₁

Status:

mark₁: multiset
S₁: multiset

The following usable rules [FROCOS05] were oriented: none

(34) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(35) PisEmptyProof (EQUIVALENT transformation)

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

(36) TRUE

(37) Obligation:

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

NATSFROM(ok(X)) → NATSFROM(X)
NATSFROM(mark(X)) → NATSFROM(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(38) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

NATSFROM(ok(X)) → NATSFROM(X)

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

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

[NATSFROM₁, ok₁]

Status:

ok₁: multiset
NATSFROM₁: [1]

The following usable rules [FROCOS05] were oriented: none

(39) Obligation:

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

NATSFROM(mark(X)) → NATSFROM(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(40) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

NATSFROM(mark(X)) → NATSFROM(X)

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

mark₁ > NATSFROM₁

Status:

mark₁: multiset
NATSFROM₁: multiset

The following usable rules [FROCOS05] were oriented: none

(41) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(42) PisEmptyProof (EQUIVALENT transformation)

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

(43) TRUE

(44) Obligation:

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

FST(ok(X)) → FST(X)
FST(mark(X)) → FST(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(45) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

FST(ok(X)) → FST(X)

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

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

[FST₁, ok₁]

Status:

FST₁: [1]
ok₁: multiset

The following usable rules [FROCOS05] were oriented: none

(46) Obligation:

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

FST(mark(X)) → FST(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(47) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

FST(mark(X)) → FST(X)

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

mark₁ > FST₁

Status:

FST₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(48) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(49) PisEmptyProof (EQUIVALENT transformation)

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

(50) TRUE

(51) Obligation:

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

U82¹(ok(X1), ok(X2), ok(X3)) → U82¹(X1, X2, X3)
U82¹(mark(X1), X2, X3) → U82¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(52) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U82¹(ok(X1), ok(X2), ok(X3)) → U82¹(X1, X2, X3)

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

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

[U82^1₃, ok₁]

Status:

ok₁: multiset
U82^1₃: multiset

The following usable rules [FROCOS05] were oriented: none

(53) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(54) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[U82^1₃, mark₁]

Status:

mark₁: [1]
U82^1₃: [2,3,1]

The following usable rules [FROCOS05] were oriented: none

(55) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(56) PisEmptyProof (EQUIVALENT transformation)

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

(57) TRUE

(58) Obligation:

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

U81¹(ok(X1), ok(X2), ok(X3)) → U81¹(X1, X2, X3)
U81¹(mark(X1), X2, X3) → U81¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(59) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U81¹(ok(X1), ok(X2), ok(X3)) → U81¹(X1, X2, X3)

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

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

[U81^1₃, ok₁]

Status:

U81^1₃: multiset
ok₁: multiset

The following usable rules [FROCOS05] were oriented: none

(60) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(61) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[U81^1₃, mark₁]

Status:

U81^1₃: [2,3,1]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(62) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(63) PisEmptyProof (EQUIVALENT transformation)

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

(64) TRUE

(65) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(66) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U72¹(ok(X1), ok(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¹(x2)
ok(x1)  =  ok(x1)
mark(x1)  =  mark

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(67) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(69) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(70) PisEmptyProof (EQUIVALENT transformation)

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

(71) TRUE

(72) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(73) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U71¹(ok(X1), ok(X2)) → U71¹(X1, X2)

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

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(74) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(75) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

trivial

Status:

U71^1₂: [1,2]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(76) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(77) PisEmptyProof (EQUIVALENT transformation)

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

(78) TRUE

(79) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(80) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(81) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(83) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(84) PisEmptyProof (EQUIVALENT transformation)

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

(85) TRUE

(86) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(87) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PAIR(X1, mark(X2)) → PAIR(X1, X2)

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

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

[PAIR₁, mark₁]

Status:

mark₁: multiset
PAIR₁: multiset

The following usable rules [FROCOS05] were oriented: none

(88) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(89) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PAIR(mark(X1), X2) → PAIR(X1, X2)

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

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

trivial

Status:

PAIR₂: [2,1]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(90) Obligation:

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

PAIR(ok(X1), ok(X2)) → PAIR(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(91) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PAIR(ok(X1), ok(X2)) → PAIR(X1, X2)

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

[PAIR₂, ok₁]

Status:

PAIR₂: [1,2]
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(92) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(93) PisEmptyProof (EQUIVALENT transformation)

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

(94) TRUE

(95) Obligation:

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

U64¹(ok(X1), ok(X2)) → U64¹(X1, X2)
U64¹(mark(X1), X2) → U64¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(96) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U64¹(ok(X1), ok(X2)) → U64¹(X1, X2)

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

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

trivial

Status:

U64^1₁: multiset
mark: multiset
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(97) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(98) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

trivial

Status:

U64^1₂: [1,2]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(99) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(100) PisEmptyProof (EQUIVALENT transformation)

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

(101) TRUE

(102) Obligation:

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

U63¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U63¹(X1, X2, X3, X4)
U63¹(mark(X1), X2, X3, X4) → U63¹(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(103) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U63¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U63¹(X1, X2, X3, X4)

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

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

ok₁ > U63^1₂
mark > U63^1₂

Status:

U63^1₂: [2,1]
mark: multiset
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(104) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(105) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

trivial

Status:

U63^1₂: [1,2]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(106) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(107) PisEmptyProof (EQUIVALENT transformation)

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

(108) TRUE

(109) Obligation:

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

U62¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U62¹(X1, X2, X3, X4)
U62¹(mark(X1), X2, X3, X4) → U62¹(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(110) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U62¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U62¹(X1, X2, X3, X4)

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

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

ok₁ > U62^1₂
mark > U62^1₂

Status:

mark: multiset
ok₁: [1]
U62^1₂: [2,1]

The following usable rules [FROCOS05] were oriented: none

(111) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(112) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

trivial

Status:

mark₁: [1]
U62^1₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(113) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(114) PisEmptyProof (EQUIVALENT transformation)

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

(115) TRUE

(116) Obligation:

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

U61¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U61¹(X1, X2, X3, X4)
U61¹(mark(X1), X2, X3, X4) → U61¹(X1, X2, X3, X4)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(117) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(ok(X1), ok(X2), ok(X3), ok(X4)) → U61¹(X1, X2, X3, X4)

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

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

ok₁ > U61^1₂
mark > U61^1₂

Status:

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

The following usable rules [FROCOS05] were oriented: none

(118) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(119) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(120) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(121) PisEmptyProof (EQUIVALENT transformation)

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

(122) TRUE

(123) Obligation:

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

U52¹(ok(X1), ok(X2)) → U52¹(X1, X2)
U52¹(mark(X1), X2) → U52¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(124) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U52¹(ok(X1), ok(X2)) → U52¹(X1, X2)

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

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

trivial

Status:

U52^1₁: multiset
mark: multiset
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(125) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(126) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

trivial

Status:

U52^1₂: [1,2]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(127) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(128) PisEmptyProof (EQUIVALENT transformation)

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

(129) TRUE

(130) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(131) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(ok(X1), ok(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¹(x2)
ok(x1)  =  ok(x1)
mark(x1)  =  mark

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(132) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

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

trivial

Status:

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

The following usable rules [FROCOS05] were oriented: none

(134) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(135) PisEmptyProof (EQUIVALENT transformation)

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

(136) TRUE

(137) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(138) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

AFTERNTH(X1, mark(X2)) → AFTERNTH(X1, X2)

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

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

[AFTERNTH₁, mark₁]

Status:

mark₁: multiset
AFTERNTH₁: multiset

The following usable rules [FROCOS05] were oriented: none

(139) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(140) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

AFTERNTH(mark(X1), X2) → AFTERNTH(X1, X2)

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

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

trivial

Status:

mark₁: [1]
AFTERNTH₂: [2,1]

The following usable rules [FROCOS05] were oriented: none

(141) Obligation:

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

AFTERNTH(ok(X1), ok(X2)) → AFTERNTH(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(142) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

AFTERNTH(ok(X1), ok(X2)) → AFTERNTH(X1, X2)

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

[AFTERNTH₂, ok₁]

Status:

ok₁: [1]
AFTERNTH₂: [1,2]

The following usable rules [FROCOS05] were oriented: none

(143) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(144) PisEmptyProof (EQUIVALENT transformation)

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

(145) TRUE

(146) Obligation:

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

HEAD(ok(X)) → HEAD(X)
HEAD(mark(X)) → HEAD(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(147) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

HEAD(ok(X)) → HEAD(X)

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

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

[HEAD₁, ok₁]

Status:

ok₁: multiset
HEAD₁: [1]

The following usable rules [FROCOS05] were oriented: none

(148) Obligation:

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

HEAD(mark(X)) → HEAD(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(149) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

HEAD(mark(X)) → HEAD(X)

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

mark₁ > HEAD₁

Status:

mark₁: multiset
HEAD₁: multiset

The following usable rules [FROCOS05] were oriented: none

(150) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(151) PisEmptyProof (EQUIVALENT transformation)

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

(152) TRUE

(153) Obligation:

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

U42¹(ok(X1), ok(X2), ok(X3)) → U42¹(X1, X2, X3)
U42¹(mark(X1), X2, X3) → U42¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(154) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U42¹(ok(X1), ok(X2), ok(X3)) → U42¹(X1, X2, X3)

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

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

[U42^1₃, ok₁]

Status:

U42^1₃: multiset
ok₁: multiset

The following usable rules [FROCOS05] were oriented: none

(155) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(156) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[U42^1₃, mark₁]

Status:

U42^1₃: [2,3,1]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(157) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(158) PisEmptyProof (EQUIVALENT transformation)

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

(159) TRUE

(160) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(161) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U41¹(ok(X1), ok(X2), ok(X3)) → U41¹(X1, X2, X3)

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

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

[U41^1₃, ok₁]

Status:

ok₁: multiset
U41^1₃: multiset

The following usable rules [FROCOS05] were oriented: none

(162) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(163) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[U41^1₃, mark₁]

Status:

mark₁: [1]
U41^1₃: [2,3,1]

The following usable rules [FROCOS05] were oriented: none

(164) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(165) PisEmptyProof (EQUIVALENT transformation)

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

(166) TRUE

(167) Obligation:

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

U32¹(ok(X1), ok(X2)) → U32¹(X1, X2)
U32¹(mark(X1), X2) → U32¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(168) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U32¹(ok(X1), ok(X2)) → U32¹(X1, X2)

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

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

trivial

Status:

mark: multiset
U32^1₁: multiset
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(169) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(170) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

trivial

Status:

U32^1₂: [1,2]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(171) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(172) PisEmptyProof (EQUIVALENT transformation)

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

(173) TRUE

(174) Obligation:

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

U31¹(ok(X1), ok(X2)) → U31¹(X1, X2)
U31¹(mark(X1), X2) → U31¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(175) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U31¹(ok(X1), ok(X2)) → U31¹(X1, X2)

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

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

trivial

Status:

U31^1₁: multiset
mark: multiset
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(176) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(177) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

trivial

Status:

U31^1₂: [1,2]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(178) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(179) PisEmptyProof (EQUIVALENT transformation)

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

(180) TRUE

(181) Obligation:

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

U22¹(ok(X1), ok(X2)) → U22¹(X1, X2)
U22¹(mark(X1), X2) → U22¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(182) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U22¹(ok(X1), ok(X2)) → U22¹(X1, X2)

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

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

trivial

Status:

U22^1₁: multiset
mark: multiset
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(183) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(184) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

trivial

Status:

U22^1₂: [1,2]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(185) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(186) PisEmptyProof (EQUIVALENT transformation)

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

(187) TRUE

(188) Obligation:

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

U21¹(ok(X1), ok(X2)) → U21¹(X1, X2)
U21¹(mark(X1), X2) → U21¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(189) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U21¹(ok(X1), ok(X2)) → U21¹(X1, X2)

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

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

trivial

Status:

mark: multiset
U21^1₁: multiset
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(190) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(191) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

trivial

Status:

U21^1₂: [1,2]
mark₁: [1]

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(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(196) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SPLITAT(X1, mark(X2)) → SPLITAT(X1, X2)

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

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

[SPLITAT₁, mark₁]

Status:

SPLITAT₁: multiset
mark₁: multiset

The following usable rules [FROCOS05] were oriented: none

(197) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(198) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SPLITAT(mark(X1), X2) → SPLITAT(X1, X2)

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

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

trivial

Status:

SPLITAT₂: [2,1]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(199) Obligation:

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

SPLITAT(ok(X1), ok(X2)) → SPLITAT(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(200) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SPLITAT(ok(X1), ok(X2)) → SPLITAT(X1, X2)

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

[SPLITAT₂, ok₁]

Status:

SPLITAT₂: [1,2]
ok₁: [1]

The following usable rules [FROCOS05] were oriented: none

(201) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(202) PisEmptyProof (EQUIVALENT transformation)

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

(203) TRUE

(204) Obligation:

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

SND(ok(X)) → SND(X)
SND(mark(X)) → SND(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(205) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SND(ok(X)) → SND(X)

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

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

[SND₁, ok₁]

Status:

ok₁: multiset
SND₁: [1]

The following usable rules [FROCOS05] were oriented: none

(206) Obligation:

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

SND(mark(X)) → SND(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(207) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SND(mark(X)) → SND(X)

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

mark₁ > SND₁

Status:

mark₁: multiset
SND₁: multiset

The following usable rules [FROCOS05] were oriented: none

(208) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(209) PisEmptyProof (EQUIVALENT transformation)

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

(210) TRUE

(211) Obligation:

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

U12¹(ok(X1), ok(X2), ok(X3)) → U12¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(212) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(ok(X1), ok(X2), ok(X3)) → U12¹(X1, X2, X3)

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

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

[U12^1₃, ok₁]

Status:

U12^1₃: multiset
ok₁: multiset

The following usable rules [FROCOS05] were oriented: none

(213) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(214) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[U12^1₃, mark₁]

Status:

U12^1₃: [2,3,1]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(215) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(216) PisEmptyProof (EQUIVALENT transformation)

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

(217) TRUE

(218) Obligation:

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

U11¹(ok(X1), ok(X2), ok(X3)) → U11¹(X1, X2, X3)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(219) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(ok(X1), ok(X2), ok(X3)) → U11¹(X1, X2, X3)

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

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

[U11^1₃, ok₁]

Status:

U11^1₃: multiset
ok₁: multiset

The following usable rules [FROCOS05] were oriented: none

(220) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(221) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[U11^1₃, mark₁]

Status:

U11^1₃: [2,3,1]
mark₁: [1]

The following usable rules [FROCOS05] were oriented: none

(222) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(223) PisEmptyProof (EQUIVALENT transformation)

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

(224) TRUE

(225) Obligation:

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

PROPER(U11(X1, X2, X3)) → PROPER(X2)
PROPER(U11(X1, X2, X3)) → PROPER(X1)
PROPER(U11(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2, X3)) → PROPER(X1)
PROPER(U12(X1, X2, X3)) → PROPER(X2)
PROPER(U12(X1, X2, X3)) → PROPER(X3)
PROPER(snd(X)) → PROPER(X)
PROPER(splitAt(X1, X2)) → PROPER(X1)
PROPER(splitAt(X1, X2)) → PROPER(X2)
PROPER(U21(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2)) → PROPER(X2)
PROPER(U22(X1, X2)) → PROPER(X1)
PROPER(U22(X1, X2)) → PROPER(X2)
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U32(X1, X2)) → PROPER(X1)
PROPER(U32(X1, X2)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X1)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X3)
PROPER(U42(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
PROPER(U42(X1, X2, X3)) → PROPER(X3)
PROPER(head(X)) → PROPER(X)
PROPER(afterNth(X1, X2)) → PROPER(X1)
PROPER(afterNth(X1, X2)) → PROPER(X2)
PROPER(U51(X1, X2)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X2)
PROPER(U52(X1, X2)) → PROPER(X1)
PROPER(U52(X1, X2)) → PROPER(X2)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U64(X1, X2)) → PROPER(X1)
PROPER(U64(X1, X2)) → PROPER(X2)
PROPER(pair(X1, X2)) → PROPER(X1)
PROPER(pair(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(U71(X1, X2)) → PROPER(X1)
PROPER(U71(X1, X2)) → PROPER(X2)
PROPER(U72(X1, X2)) → PROPER(X1)
PROPER(U72(X1, X2)) → PROPER(X2)
PROPER(U81(X1, X2, X3)) → PROPER(X1)
PROPER(U81(X1, X2, X3)) → PROPER(X2)
PROPER(U81(X1, X2, X3)) → PROPER(X3)
PROPER(U82(X1, X2, X3)) → PROPER(X1)
PROPER(U82(X1, X2, X3)) → PROPER(X2)
PROPER(U82(X1, X2, X3)) → PROPER(X3)
PROPER(fst(X)) → PROPER(X)
PROPER(natsFrom(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(sel(X1, X2)) → PROPER(X1)
PROPER(sel(X1, X2)) → PROPER(X2)
PROPER(tail(X)) → PROPER(X)
PROPER(take(X1, X2)) → PROPER(X1)
PROPER(take(X1, X2)) → PROPER(X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(226) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(U11(X1, X2, X3)) → PROPER(X2)
PROPER(U11(X1, X2, X3)) → PROPER(X1)
PROPER(U11(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2, X3)) → PROPER(X1)
PROPER(U12(X1, X2, X3)) → PROPER(X2)
PROPER(U12(X1, X2, X3)) → PROPER(X3)
PROPER(splitAt(X1, X2)) → PROPER(X1)
PROPER(splitAt(X1, X2)) → PROPER(X2)
PROPER(U21(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2)) → PROPER(X2)
PROPER(U22(X1, X2)) → PROPER(X1)
PROPER(U22(X1, X2)) → PROPER(X2)
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U32(X1, X2)) → PROPER(X1)
PROPER(U32(X1, X2)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X1)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X3)
PROPER(U42(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
PROPER(U42(X1, X2, X3)) → PROPER(X3)
PROPER(afterNth(X1, X2)) → PROPER(X1)
PROPER(afterNth(X1, X2)) → PROPER(X2)
PROPER(U51(X1, X2)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X2)
PROPER(U52(X1, X2)) → PROPER(X1)
PROPER(U52(X1, X2)) → PROPER(X2)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U61(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U62(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X1)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X2)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X3)
PROPER(U63(X1, X2, X3, X4)) → PROPER(X4)
PROPER(U64(X1, X2)) → PROPER(X1)
PROPER(U64(X1, X2)) → PROPER(X2)
PROPER(pair(X1, X2)) → PROPER(X1)
PROPER(pair(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(U71(X1, X2)) → PROPER(X1)
PROPER(U71(X1, X2)) → PROPER(X2)
PROPER(U72(X1, X2)) → PROPER(X1)
PROPER(U72(X1, X2)) → PROPER(X2)
PROPER(U81(X1, X2, X3)) → PROPER(X1)
PROPER(U81(X1, X2, X3)) → PROPER(X2)
PROPER(U81(X1, X2, X3)) → PROPER(X3)
PROPER(U82(X1, X2, X3)) → PROPER(X1)
PROPER(U82(X1, X2, X3)) → PROPER(X2)
PROPER(U82(X1, X2, X3)) → PROPER(X3)
PROPER(natsFrom(X)) → PROPER(X)
PROPER(sel(X1, X2)) → PROPER(X1)
PROPER(sel(X1, X2)) → PROPER(X2)
PROPER(take(X1, X2)) → PROPER(X1)
PROPER(take(X1, X2)) → PROPER(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
U11(x1, x2, x3)  =  U11(x1, x2, x3)
U12(x1, x2, x3)  =  U12(x1, x2, x3)
snd(x1)  =  x1
splitAt(x1, x2)  =  splitAt(x1, x2)
U21(x1, x2)  =  U21(x1, x2)
U22(x1, x2)  =  U22(x1, x2)
U31(x1, x2)  =  U31(x1, x2)
U32(x1, x2)  =  U32(x1, x2)
U41(x1, x2, x3)  =  U41(x1, x2, x3)
U42(x1, x2, x3)  =  U42(x1, x2, x3)
head(x1)  =  x1
afterNth(x1, x2)  =  afterNth(x1, x2)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3, x4)  =  U61(x1, x2, x3, x4)
U62(x1, x2, x3, x4)  =  U62(x1, x2, x3, x4)
U63(x1, x2, x3, x4)  =  U63(x1, x2, x3, x4)
U64(x1, x2)  =  U64(x1, x2)
pair(x1, x2)  =  pair(x1, x2)
cons(x1, x2)  =  cons(x1, x2)
U71(x1, x2)  =  U71(x1, x2)
U72(x1, x2)  =  U72(x1, x2)
U81(x1, x2, x3)  =  U81(x1, x2, x3)
U82(x1, x2, x3)  =  U82(x1, x2, x3)
fst(x1)  =  x1
natsFrom(x1)  =  natsFrom(x1)
s(x1)  =  x1
sel(x1, x2)  =  sel(x1, x2)
tail(x1)  =  x1
take(x1, x2)  =  take(x1, x2)

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

U52₂ > [PROPER₁, U11₃, U21₂, afterNth₂, U63₄, U64₂, pair₂, natsFrom₁, sel₂, take₂]
U61₄ > [PROPER₁, U11₃, U21₂, afterNth₂, U63₄, U64₂, pair₂, natsFrom₁, sel₂, take₂]

Status:

sel₂: multiset
U52₂: multiset
U82₃: multiset
U41₃: multiset
U32₂: multiset
take₂: multiset
splitAt₂: [2,1]
U71₂: multiset
U51₂: multiset
U21₂: multiset
U42₃: multiset
U61₄: [4,1,3,2]
pair₂: multiset
U63₄: multiset
natsFrom₁: multiset
PROPER₁: [1]
afterNth₂: multiset
U31₂: multiset
U22₂: multiset
U81₃: multiset
U11₃: multiset
U72₂: multiset
U62₄: [3,4,1,2]
cons₂: multiset
U64₂: multiset
U12₃: multiset

The following usable rules [FROCOS05] were oriented: none

(227) Obligation:

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

PROPER(snd(X)) → PROPER(X)
PROPER(head(X)) → PROPER(X)
PROPER(fst(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(tail(X)) → PROPER(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(228) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(snd(X)) → PROPER(X)

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

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

trivial

Status:

PROPER₁: [1]
snd₁: multiset

The following usable rules [FROCOS05] were oriented: none

(229) Obligation:

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

PROPER(head(X)) → PROPER(X)
PROPER(fst(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(tail(X)) → PROPER(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(230) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

trivial

Status:

PROPER₁: [1]
s₁: multiset

The following usable rules [FROCOS05] were oriented: none

(231) Obligation:

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

PROPER(head(X)) → PROPER(X)
PROPER(fst(X)) → PROPER(X)
PROPER(tail(X)) → PROPER(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(232) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(tail(X)) → PROPER(X)

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

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

[PROPER₁, tail₁]

Status:

PROPER₁: multiset
tail₁: multiset

The following usable rules [FROCOS05] were oriented: none

(233) Obligation:

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

PROPER(head(X)) → PROPER(X)
PROPER(fst(X)) → PROPER(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(234) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(head(X)) → PROPER(X)

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

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

[PROPER₁, head₁]

Status:

PROPER₁: [1]
head₁: multiset

The following usable rules [FROCOS05] were oriented: none

(235) Obligation:

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

PROPER(fst(X)) → PROPER(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(236) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(fst(X)) → PROPER(X)

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

fst₁ > PROPER₁

Status:

PROPER₁: multiset
fst₁: multiset

The following usable rules [FROCOS05] were oriented: none

(237) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(238) PisEmptyProof (EQUIVALENT transformation)

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

(239) TRUE

(240) Obligation:

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

ACTIVE(U12(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U11(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(snd(X)) → ACTIVE(X)
ACTIVE(splitAt(X1, X2)) → ACTIVE(X1)
ACTIVE(splitAt(X1, X2)) → ACTIVE(X2)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(head(X)) → ACTIVE(X)
ACTIVE(afterNth(X1, X2)) → ACTIVE(X1)
ACTIVE(afterNth(X1, X2)) → ACTIVE(X2)
ACTIVE(U51(X1, X2)) → ACTIVE(X1)
ACTIVE(U52(X1, X2)) → ACTIVE(X1)
ACTIVE(U61(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(U62(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(U63(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(U64(X1, X2)) → ACTIVE(X1)
ACTIVE(pair(X1, X2)) → ACTIVE(X1)
ACTIVE(pair(X1, X2)) → ACTIVE(X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(U71(X1, X2)) → ACTIVE(X1)
ACTIVE(U72(X1, X2)) → ACTIVE(X1)
ACTIVE(U81(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U82(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(fst(X)) → ACTIVE(X)
ACTIVE(natsFrom(X)) → ACTIVE(X)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(sel(X1, X2)) → ACTIVE(X1)
ACTIVE(sel(X1, X2)) → ACTIVE(X2)
ACTIVE(tail(X)) → ACTIVE(X)
ACTIVE(take(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → ACTIVE(X2)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(241) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U12(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U11(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(splitAt(X1, X2)) → ACTIVE(X1)
ACTIVE(splitAt(X1, X2)) → ACTIVE(X2)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(afterNth(X1, X2)) → ACTIVE(X1)
ACTIVE(afterNth(X1, X2)) → ACTIVE(X2)
ACTIVE(U51(X1, X2)) → ACTIVE(X1)
ACTIVE(U61(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(U62(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(U63(X1, X2, X3, X4)) → ACTIVE(X1)
ACTIVE(pair(X1, X2)) → ACTIVE(X1)
ACTIVE(pair(X1, X2)) → ACTIVE(X2)
ACTIVE(U72(X1, X2)) → ACTIVE(X1)
ACTIVE(U82(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(fst(X)) → ACTIVE(X)
ACTIVE(natsFrom(X)) → ACTIVE(X)
ACTIVE(sel(X1, X2)) → ACTIVE(X1)
ACTIVE(sel(X1, X2)) → ACTIVE(X2)
ACTIVE(take(X1, X2)) → ACTIVE(X1)
ACTIVE(take(X1, X2)) → ACTIVE(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
U12(x1, x2, x3)  =  U12(x1)
U11(x1, x2, x3)  =  U11(x1)
snd(x1)  =  x1
splitAt(x1, x2)  =  splitAt(x1, x2)
U21(x1, x2)  =  U21(x1, x2)
U22(x1, x2)  =  x1
U31(x1, x2)  =  x1
U32(x1, x2)  =  x1
U41(x1, x2, x3)  =  U41(x1, x2, x3)
U42(x1, x2, x3)  =  x1
head(x1)  =  x1
afterNth(x1, x2)  =  afterNth(x1, x2)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  x1
U61(x1, x2, x3, x4)  =  U61(x1)
U62(x1, x2, x3, x4)  =  U62(x1, x2, x3, x4)
U63(x1, x2, x3, x4)  =  U63(x1, x4)
U64(x1, x2)  =  x1
pair(x1, x2)  =  pair(x1, x2)
cons(x1, x2)  =  x1
U71(x1, x2)  =  x1
U72(x1, x2)  =  U72(x1, x2)
U81(x1, x2, x3)  =  x1
U82(x1, x2, x3)  =  U82(x1, x2, x3)
fst(x1)  =  fst(x1)
natsFrom(x1)  =  natsFrom(x1)
s(x1)  =  x1
sel(x1, x2)  =  sel(x1, x2)
tail(x1)  =  x1
take(x1, x2)  =  take(x1, x2)

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

[ACTIVE₁, U11₁, U41₃, afterNth₂, U72₂, sel₂, take₂]

Status:

sel₂: multiset
afterNth₂: multiset
U82₃: multiset
U61₁: multiset
U41₃: [2,3,1]
U72₂: multiset
take₂: multiset
splitAt₂: multiset
ACTIVE₁: [1]
U21₂: multiset
U51₂: multiset
U62₄: multiset
U12₁: [1]
pair₂: multiset
fst₁: multiset
U11₁: multiset
natsFrom₁: multiset
U63₂: multiset

The following usable rules [FROCOS05] were oriented: none

(242) Obligation:

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

ACTIVE(snd(X)) → ACTIVE(X)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(head(X)) → ACTIVE(X)
ACTIVE(U52(X1, X2)) → ACTIVE(X1)
ACTIVE(U64(X1, X2)) → ACTIVE(X1)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(U71(X1, X2)) → ACTIVE(X1)
ACTIVE(U81(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(tail(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(243) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U81(X1, X2, X3)) → ACTIVE(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
snd(x1)  =  x1
U22(x1, x2)  =  x1
U31(x1, x2)  =  x1
U32(x1, x2)  =  x1
U42(x1, x2, x3)  =  x1
head(x1)  =  x1
U52(x1, x2)  =  x1
U64(x1, x2)  =  x1
cons(x1, x2)  =  x1
U71(x1, x2)  =  x1
U81(x1, x2, x3)  =  U81(x1, x2, x3)
s(x1)  =  x1
tail(x1)  =  x1

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

[ACTIVE₁, U81₃]

Status:

U81₃: multiset
ACTIVE₁: [1]

The following usable rules [FROCOS05] were oriented: none

(244) Obligation:

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

ACTIVE(snd(X)) → ACTIVE(X)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(head(X)) → ACTIVE(X)
ACTIVE(U52(X1, X2)) → ACTIVE(X1)
ACTIVE(U64(X1, X2)) → ACTIVE(X1)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(U71(X1, X2)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(tail(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(245) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U52(X1, X2)) → ACTIVE(X1)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(U71(X1, X2)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(tail(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
snd(x1)  =  x1
U22(x1, x2)  =  U22(x1)
U31(x1, x2)  =  x1
U32(x1, x2)  =  U32(x1, x2)
U42(x1, x2, x3)  =  U42(x1, x3)
head(x1)  =  x1
U52(x1, x2)  =  U52(x1, x2)
U64(x1, x2)  =  x1
cons(x1, x2)  =  cons(x1)
U71(x1, x2)  =  U71(x1, x2)
s(x1)  =  s(x1)
tail(x1)  =  tail(x1)

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

[ACTIVE₁, U42₂, U52₂, cons₁, s₁]

Status:

U52₂: multiset
U22₁: multiset
cons₁: multiset
tail₁: multiset
U42₂: multiset
U32₂: multiset
s₁: multiset
ACTIVE₁: [1]
U71₂: multiset

The following usable rules [FROCOS05] were oriented: none

(246) Obligation:

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

ACTIVE(snd(X)) → ACTIVE(X)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(head(X)) → ACTIVE(X)
ACTIVE(U64(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(247) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U64(X1, X2)) → ACTIVE(X1)

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

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

[ACTIVE₁, U64₂]

Status:

U64₂: multiset
ACTIVE₁: [1]

The following usable rules [FROCOS05] were oriented: none

(248) Obligation:

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

ACTIVE(snd(X)) → ACTIVE(X)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(head(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(249) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(head(X)) → ACTIVE(X)

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

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

trivial

Status:

U31₂: multiset
head₁: multiset

The following usable rules [FROCOS05] were oriented: none

(250) Obligation:

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

ACTIVE(snd(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(251) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(snd(X)) → ACTIVE(X)

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

snd₁ > ACTIVE₁

Status:

snd₁: multiset
ACTIVE₁: multiset

The following usable rules [FROCOS05] were oriented: none

(252) Obligation:

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

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(253) PisEmptyProof (EQUIVALENT transformation)

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

(254) TRUE

(255) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N, XS)) → mark(U12(tt, N, XS))
active(U12(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(U22(tt, X))
active(U22(tt, X)) → mark(X)
active(U31(tt, N)) → mark(U32(tt, N))
active(U32(tt, N)) → mark(N)
active(U41(tt, N, XS)) → mark(U42(tt, N, XS))
active(U42(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U51(tt, Y)) → mark(U52(tt, Y))
active(U52(tt, Y)) → mark(Y)
active(U61(tt, N, X, XS)) → mark(U62(tt, N, X, XS))
active(U62(tt, N, X, XS)) → mark(U63(tt, N, X, XS))
active(U63(tt, N, X, XS)) → mark(U64(splitAt(N, XS), X))
active(U64(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U71(tt, XS)) → mark(U72(tt, XS))
active(U72(tt, XS)) → mark(XS)
active(U81(tt, N, XS)) → mark(U82(tt, N, XS))
active(U82(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(afterNth(N, XS)) → mark(U11(tt, N, XS))
active(fst(pair(X, Y))) → mark(U21(tt, X))
active(head(cons(N, XS))) → mark(U31(tt, N))
active(natsFrom(N)) → mark(cons(N, natsFrom(s(N))))
active(sel(N, XS)) → mark(U41(tt, N, XS))
active(snd(pair(X, Y))) → mark(U51(tt, Y))
active(splitAt(0, XS)) → mark(pair(nil, XS))
active(splitAt(s(N), cons(X, XS))) → mark(U61(tt, N, X, XS))
active(tail(cons(N, XS))) → mark(U71(tt, XS))
active(take(N, XS)) → mark(U81(tt, N, XS))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3, X4)) → U61(active(X1), X2, X3, X4)
active(U62(X1, X2, X3, X4)) → U62(active(X1), X2, X3, X4)
active(U63(X1, X2, X3, X4)) → U63(active(X1), X2, X3, X4)
active(U64(X1, X2)) → U64(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(U72(X1, X2)) → U72(active(X1), X2)
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3, X4) → mark(U61(X1, X2, X3, X4))
U62(mark(X1), X2, X3, X4) → mark(U62(X1, X2, X3, X4))
U63(mark(X1), X2, X3, X4) → mark(U63(X1, X2, X3, X4))
U64(mark(X1), X2) → mark(U64(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
U72(mark(X1), X2) → mark(U72(X1, X2))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3, X4)) → U61(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U62(X1, X2, X3, X4)) → U62(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U63(X1, X2, X3, X4)) → U63(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U64(X1, X2)) → U64(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(U72(X1, X2)) → U72(proper(X1), proper(X2))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U61(X1, X2, X3, X4))
U62(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U62(X1, X2, X3, X4))
U63(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U63(X1, X2, X3, X4))
U64(ok(X1), ok(X2)) → ok(U64(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
U72(ok(X1), ok(X2)) → ok(U72(X1, X2))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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