Termination Proof using AProVE

Term Rewriting System R:
[X, Z, Y, X1, X2]
from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_from}(X)) -> from(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

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(X)
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)

Furthermore, R contains two SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

Dependency Pairs:

ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_from}(X)) -> from(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

The following rules can be oriented:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_from}(X)) -> from(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

{n_{_first}, first} > activate > from > n_{_from} > nil
{n_{_first}, first} > activate > from > cons > {FIRST, ACTIVATE} > nil
{n_{_first}, first} > activate > from > s > nil
0 > nil
sel > activate > from > n_{_from} > nil
sel > activate > from > cons > {FIRST, ACTIVATE} > nil
sel > activate > from > s > nil

resulting in one new DP problem.
Used Argument Filtering System:

ACTIVATE(x₁) -> ACTIVATE(x₁)
FIRST(x₁, x₂) -> FIRST(x₁, x₂)
n_{_first}(x₁, x₂) -> n_{_first}(x₁, x₂)
s(x₁) -> s(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
from(x₁) -> from(x₁)
n_{_from}(x₁) -> n_{_from}(x₁)
first(x₁, x₂) -> first(x₁, x₂)
activate(x₁) -> activate(x₁)
sel(x₁, x₂) -> sel(x₁, x₂)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 3

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_from}(X)) -> from(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳Argument Filtering and Ordering

Dependency Pair:

SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_from}(X)) -> from(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

The following dependency pair can be strictly oriented:

SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))

The following rules can be oriented:

activate(n_{_from}(X)) -> from(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

{nil, 0}
SEL > activate > from > n_{_from}
SEL > activate > from > cons
SEL > activate > from > s
{n_{_first}, first} > activate > from > n_{_from}
{n_{_first}, first} > activate > from > cons
{n_{_first}, first} > activate > from > s
sel > activate > from > n_{_from}
sel > activate > from > cons
sel > activate > from > s

resulting in one new DP problem.
Used Argument Filtering System:

SEL(x₁, x₂) -> SEL(x₁, x₂)
s(x₁) -> s(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
activate(x₁) -> activate(x₁)
n_{_from}(x₁) -> n_{_from}(x₁)
from(x₁) -> from(x₁)
n_{_first}(x₁, x₂) -> n_{_first}(x₁, x₂)
first(x₁, x₂) -> first(x₁, x₂)
sel(x₁, x₂) -> sel(x₁, x₂)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 4

             ↳Dependency Graph

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_from}(X)) -> from(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:00 minutes