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

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
  ↳5 QDP
    ↳6 QDPOrderProof (⇔)
    ↳7 QDP
    ↳8 QDPOrderProof (⇔)
    ↳9 QDP
    ↳10 PisEmptyProof (⇔)
    ↳11 TRUE
  ↳12 QDP
    ↳13 QDPOrderProof (⇔)
    ↳14 QDP
    ↳15 PisEmptyProof (⇔)
    ↳16 TRUE

(0) Obligation:

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

U11(tt, N, X, XS) → U12(splitAt(activate(N), activate(XS)), activate(X))
U12(pair(YS, ZS), X) → pair(cons(activate(X), YS), ZS)
afterNth(N, XS) → snd(splitAt(N, XS))
and(tt, X) → activate(X)
fst(pair(X, Y)) → X
head(cons(N, XS)) → N
natsFrom(N) → cons(N, n__natsFrom(n__s(N)))
sel(N, XS) → head(afterNth(N, XS))
snd(pair(X, Y)) → Y
splitAt(0, XS) → pair(nil, XS)
splitAt(s(N), cons(X, XS)) → U11(tt, N, X, activate(XS))
tail(cons(N, XS)) → activate(XS)
take(N, XS) → fst(splitAt(N, XS))
natsFrom(X) → n__natsFrom(X)
s(X) → n__s(X)
activate(n__natsFrom(X)) → natsFrom(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → 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:

U111(tt, N, X, XS) → U121(splitAt(activate(N), activate(XS)), activate(X))
U111(tt, N, X, XS) → SPLITAT(activate(N), activate(XS))
U111(tt, N, X, XS) → ACTIVATE(N)
U111(tt, N, X, XS) → ACTIVATE(XS)
U111(tt, N, X, XS) → ACTIVATE(X)
U121(pair(YS, ZS), X) → ACTIVATE(X)
AFTERNTH(N, XS) → SND(splitAt(N, XS))
AFTERNTH(N, XS) → SPLITAT(N, XS)
AND(tt, X) → ACTIVATE(X)
SEL(N, XS) → HEAD(afterNth(N, XS))
SEL(N, XS) → AFTERNTH(N, XS)
SPLITAT(s(N), cons(X, XS)) → U111(tt, N, X, activate(XS))
SPLITAT(s(N), cons(X, XS)) → ACTIVATE(XS)
TAIL(cons(N, XS)) → ACTIVATE(XS)
TAKE(N, XS) → FST(splitAt(N, XS))
TAKE(N, XS) → SPLITAT(N, XS)
ACTIVATE(n__natsFrom(X)) → NATSFROM(activate(X))
ACTIVATE(n__natsFrom(X)) → ACTIVATE(X)
ACTIVATE(n__s(X)) → S(activate(X))
ACTIVATE(n__s(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

U11(tt, N, X, XS) → U12(splitAt(activate(N), activate(XS)), activate(X))
U12(pair(YS, ZS), X) → pair(cons(activate(X), YS), ZS)
afterNth(N, XS) → snd(splitAt(N, XS))
and(tt, X) → activate(X)
fst(pair(X, Y)) → X
head(cons(N, XS)) → N
natsFrom(N) → cons(N, n__natsFrom(n__s(N)))
sel(N, XS) → head(afterNth(N, XS))
snd(pair(X, Y)) → Y
splitAt(0, XS) → pair(nil, XS)
splitAt(s(N), cons(X, XS)) → U11(tt, N, X, activate(XS))
tail(cons(N, XS)) → activate(XS)
take(N, XS) → fst(splitAt(N, XS))
natsFrom(X) → n__natsFrom(X)
s(X) → n__s(X)
activate(n__natsFrom(X)) → natsFrom(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → 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 2 SCCs with 16 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

ACTIVATE(n__s(X)) → ACTIVATE(X)
ACTIVATE(n__natsFrom(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

U11(tt, N, X, XS) → U12(splitAt(activate(N), activate(XS)), activate(X))
U12(pair(YS, ZS), X) → pair(cons(activate(X), YS), ZS)
afterNth(N, XS) → snd(splitAt(N, XS))
and(tt, X) → activate(X)
fst(pair(X, Y)) → X
head(cons(N, XS)) → N
natsFrom(N) → cons(N, n__natsFrom(n__s(N)))
sel(N, XS) → head(afterNth(N, XS))
snd(pair(X, Y)) → Y
splitAt(0, XS) → pair(nil, XS)
splitAt(s(N), cons(X, XS)) → U11(tt, N, X, activate(XS))
tail(cons(N, XS)) → activate(XS)
take(N, XS) → fst(splitAt(N, XS))
natsFrom(X) → n__natsFrom(X)
s(X) → n__s(X)
activate(n__natsFrom(X)) → natsFrom(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → 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.


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

Lexicographic path order with status [LPO].
Quasi-Precedence:
trivial

Status:
ns1: [1]


The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

ACTIVATE(n__natsFrom(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

U11(tt, N, X, XS) → U12(splitAt(activate(N), activate(XS)), activate(X))
U12(pair(YS, ZS), X) → pair(cons(activate(X), YS), ZS)
afterNth(N, XS) → snd(splitAt(N, XS))
and(tt, X) → activate(X)
fst(pair(X, Y)) → X
head(cons(N, XS)) → N
natsFrom(N) → cons(N, n__natsFrom(n__s(N)))
sel(N, XS) → head(afterNth(N, XS))
snd(pair(X, Y)) → Y
splitAt(0, XS) → pair(nil, XS)
splitAt(s(N), cons(X, XS)) → U11(tt, N, X, activate(XS))
tail(cons(N, XS)) → activate(XS)
take(N, XS) → fst(splitAt(N, XS))
natsFrom(X) → n__natsFrom(X)
s(X) → n__s(X)
activate(n__natsFrom(X)) → natsFrom(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → 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.


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

Lexicographic path order with status [LPO].
Quasi-Precedence:
trivial

Status:
nnatsFrom1: [1]


The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

U11(tt, N, X, XS) → U12(splitAt(activate(N), activate(XS)), activate(X))
U12(pair(YS, ZS), X) → pair(cons(activate(X), YS), ZS)
afterNth(N, XS) → snd(splitAt(N, XS))
and(tt, X) → activate(X)
fst(pair(X, Y)) → X
head(cons(N, XS)) → N
natsFrom(N) → cons(N, n__natsFrom(n__s(N)))
sel(N, XS) → head(afterNth(N, XS))
snd(pair(X, Y)) → Y
splitAt(0, XS) → pair(nil, XS)
splitAt(s(N), cons(X, XS)) → U11(tt, N, X, activate(XS))
tail(cons(N, XS)) → activate(XS)
take(N, XS) → fst(splitAt(N, XS))
natsFrom(X) → n__natsFrom(X)
s(X) → n__s(X)
activate(n__natsFrom(X)) → natsFrom(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → X

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

(10) PisEmptyProof (EQUIVALENT transformation)

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

(11) TRUE

(12) Obligation:

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

U111(tt, N, X, XS) → SPLITAT(activate(N), activate(XS))
SPLITAT(s(N), cons(X, XS)) → U111(tt, N, X, activate(XS))

The TRS R consists of the following rules:

U11(tt, N, X, XS) → U12(splitAt(activate(N), activate(XS)), activate(X))
U12(pair(YS, ZS), X) → pair(cons(activate(X), YS), ZS)
afterNth(N, XS) → snd(splitAt(N, XS))
and(tt, X) → activate(X)
fst(pair(X, Y)) → X
head(cons(N, XS)) → N
natsFrom(N) → cons(N, n__natsFrom(n__s(N)))
sel(N, XS) → head(afterNth(N, XS))
snd(pair(X, Y)) → Y
splitAt(0, XS) → pair(nil, XS)
splitAt(s(N), cons(X, XS)) → U11(tt, N, X, activate(XS))
tail(cons(N, XS)) → activate(XS)
take(N, XS) → fst(splitAt(N, XS))
natsFrom(X) → n__natsFrom(X)
s(X) → n__s(X)
activate(n__natsFrom(X)) → natsFrom(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → X

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

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U111(tt, N, X, XS) → SPLITAT(activate(N), activate(XS))
SPLITAT(s(N), cons(X, XS)) → U111(tt, N, X, activate(XS))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U111(x1, x2, x3, x4)  =  U111(x2)
tt  =  tt
SPLITAT(x1, x2)  =  x1
activate(x1)  =  x1
s(x1)  =  s(x1)
cons(x1, x2)  =  cons
n__natsFrom(x1)  =  x1
natsFrom(x1)  =  x1
n__s(x1)  =  n__s(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
[s1, ns1] > [U11^11, tt, cons]

Status:
U11^11: [1]
tt: []
s1: [1]
cons: []
ns1: [1]


The following usable rules [FROCOS05] were oriented:

activate(n__natsFrom(X)) → natsFrom(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → X
s(X) → n__s(X)
natsFrom(N) → cons(N, n__natsFrom(n__s(N)))
natsFrom(X) → n__natsFrom(X)

(14) Obligation:

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

U11(tt, N, X, XS) → U12(splitAt(activate(N), activate(XS)), activate(X))
U12(pair(YS, ZS), X) → pair(cons(activate(X), YS), ZS)
afterNth(N, XS) → snd(splitAt(N, XS))
and(tt, X) → activate(X)
fst(pair(X, Y)) → X
head(cons(N, XS)) → N
natsFrom(N) → cons(N, n__natsFrom(n__s(N)))
sel(N, XS) → head(afterNth(N, XS))
snd(pair(X, Y)) → Y
splitAt(0, XS) → pair(nil, XS)
splitAt(s(N), cons(X, XS)) → U11(tt, N, X, activate(XS))
tail(cons(N, XS)) → activate(XS)
take(N, XS) → fst(splitAt(N, XS))
natsFrom(X) → n__natsFrom(X)
s(X) → n__s(X)
activate(n__natsFrom(X)) → natsFrom(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → X

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

(15) PisEmptyProof (EQUIVALENT transformation)

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

(16) TRUE