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 QDPOrderProof (⇔)
        ↳11 QDP
        ↳12 PisEmptyProof (⇔)
        ↳13 TRUE
    ↳14 QDP
        ↳15 QDPOrderProof (⇔)
        ↳16 QDP
        ↳17 PisEmptyProof (⇔)
        ↳18 TRUE

(0) Obligation:

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

from(X) → cons(X, n__from(n__s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
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:

FIRST(s(X), cons(Y, Z)) → ACTIVATE(Z)
SEL(s(X), cons(Y, Z)) → SEL(X, activate(Z))
SEL(s(X), cons(Y, Z)) → ACTIVATE(Z)
ACTIVATE(n__from(X)) → FROM(activate(X))
ACTIVATE(n__from(X)) → ACTIVATE(X)
ACTIVATE(n__s(X)) → S(activate(X))
ACTIVATE(n__s(X)) → ACTIVATE(X)
ACTIVATE(n__first(X1, X2)) → FIRST(activate(X1), activate(X2))
ACTIVATE(n__first(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__first(X1, X2)) → ACTIVATE(X2)

The TRS R consists of the following rules:

from(X) → cons(X, n__from(n__s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
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 3 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

ACTIVATE(n__from(X)) → ACTIVATE(X)
ACTIVATE(n__s(X)) → ACTIVATE(X)
ACTIVATE(n__first(X1, X2)) → FIRST(activate(X1), activate(X2))
FIRST(s(X), cons(Y, Z)) → ACTIVATE(Z)
ACTIVATE(n__first(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__first(X1, X2)) → ACTIVATE(X2)

The TRS R consists of the following rules:

from(X) → cons(X, n__from(n__s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
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__first(X1, X2)) → FIRST(activate(X1), activate(X2))
FIRST(s(X), cons(Y, Z)) → ACTIVATE(Z)
ACTIVATE(n__first(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__first(X1, X2)) → ACTIVATE(X2)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVATE(x0, x1)  =  ACTIVATE(x0)
FIRST(x0, x1, x2)  =  FIRST(x0)

Tags:
ACTIVATE has argument tags [4,2] and root tag 1
FIRST has argument tags [4,6,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
ACTIVATE(x1)  =  x1
n__from(x1)  =  x1
n__s(x1)  =  x1
n__first(x1, x2)  =  n__first(x1, x2)
FIRST(x1, x2)  =  FIRST(x1, x2)
activate(x1)  =  x1
s(x1)  =  x1
cons(x1, x2)  =  x2
from(x1)  =  x1
first(x1, x2)  =  first(x1, x2)
0  =  0
nil  =  nil

Recursive path order with status [RPO].
Quasi-Precedence:
[nfirst2, FIRST2, first2] > [0, nil]

Status:
nfirst2: multiset
FIRST2: multiset
first2: multiset
0: multiset
nil: multiset


The following usable rules [FROCOS05] were oriented:

activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
activate(X) → X
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
s(X) → n__s(X)
from(X) → cons(X, n__from(n__s(X)))
from(X) → n__from(X)
first(0, Z) → nil
first(X1, X2) → n__first(X1, X2)

(7) Obligation:

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

ACTIVATE(n__from(X)) → ACTIVATE(X)
ACTIVATE(n__s(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

from(X) → cons(X, n__from(n__s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
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__from(X)) → ACTIVATE(X)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVATE(x0, x1)  =  ACTIVATE(x0, x1)

Tags:
ACTIVATE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
ACTIVATE(x1)  =  ACTIVATE
n__from(x1)  =  n__from(x1)
n__s(x1)  =  x1

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

Status:
ACTIVATE: multiset
nfrom1: multiset


The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

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

The TRS R consists of the following rules:

from(X) → cons(X, n__from(n__s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
activate(X) → 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.


ACTIVATE(n__s(X)) → ACTIVATE(X)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVATE(x0, x1)  =  ACTIVATE(x0, x1)

Tags:
ACTIVATE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
ACTIVATE(x1)  =  ACTIVATE
n__s(x1)  =  n__s(x1)

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

Status:
ACTIVATE: multiset
ns1: multiset


The following usable rules [FROCOS05] were oriented: none

(11) Obligation:

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

from(X) → cons(X, n__from(n__s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
activate(X) → 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:

SEL(s(X), cons(Y, Z)) → SEL(X, activate(Z))

The TRS R consists of the following rules:

from(X) → cons(X, n__from(n__s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
activate(X) → 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.


SEL(s(X), cons(Y, Z)) → SEL(X, activate(Z))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
SEL(x0, x1, x2)  =  SEL(x1)

Tags:
SEL has argument tags [2,3,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
SEL(x1, x2)  =  x2
s(x1)  =  s(x1)
cons(x1, x2)  =  x1
activate(x1)  =  activate(x1)
n__from(x1)  =  x1
from(x1)  =  x1
n__s(x1)  =  n__s(x1)
n__first(x1, x2)  =  n__first(x1, x2)
first(x1, x2)  =  first(x1, x2)
0  =  0
nil  =  nil

Recursive path order with status [RPO].
Quasi-Precedence:
[s1, activate1, ns1] > [nfirst2, first2]
0 > nil > [nfirst2, first2]

Status:
s1: [1]
activate1: [1]
ns1: [1]
nfirst2: multiset
first2: multiset
0: multiset
nil: multiset


The following usable rules [FROCOS05] were oriented:

activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
activate(X) → X
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
s(X) → n__s(X)
from(X) → cons(X, n__from(n__s(X)))
from(X) → n__from(X)
first(0, Z) → nil
first(X1, X2) → n__first(X1, X2)

(16) Obligation:

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

from(X) → cons(X, n__from(n__s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
activate(X) → X

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

(17) PisEmptyProof (EQUIVALENT transformation)

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

(18) TRUE