Termination Proof using AProVE

Term Rewriting System R:
[Z, X, Y, X1, X2]
fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
s(X) -> n_{_s}(X)
activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

FST(s(X), cons(Y, Z)) -> ACTIVATE(X)
FST(s(X), cons(Y, Z)) -> ACTIVATE(Z)
ADD(s(X), Y) -> S(n_{_add}(activate(X), Y))
ADD(s(X), Y) -> ACTIVATE(X)
LEN(cons(X, Z)) -> S(n_{_len}(activate(Z)))
LEN(cons(X, Z)) -> ACTIVATE(Z)
ACTIVATE(n_{_fst}(X1, X2)) -> FST(activate(X1), activate(X2))
ACTIVATE(n_{_fst}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_fst}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_from}(X)) -> FROM(activate(X))
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_s}(X)) -> S(X)
ACTIVATE(n_{_add}(X1, X2)) -> ADD(activate(X1), activate(X2))
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_len}(X)) -> LEN(activate(X))
ACTIVATE(n_{_len}(X)) -> ACTIVATE(X)

Furthermore, R contains one SCC.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

Dependency Pairs:

ACTIVATE(n_{_len}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_len}(X)) -> LEN(activate(X))
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_fst}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_fst}(X1, X2)) -> ACTIVATE(X1)
LEN(cons(X, Z)) -> ACTIVATE(Z)

Rules:

fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
s(X) -> n_{_s}(X)
activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_fst}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_fst}(X1, X2)) -> ACTIVATE(X1)

The following usable rules for innermost can be oriented:

activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
s(X) -> n_{_s}(X)

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(activate(x₁)) = x₁

POL(len(x₁)) = x₁

POL(n__fst(x₁, x₂)) = 1 + x₁ + x₂

POL(LEN(x₁)) = x₁

POL(n__s(x₁)) = x₁

POL(ACTIVATE(x₁)) = x₁

POL(add(x₁, x₂)) = x₁ + x₂

POL(n__from(x₁)) = x₁

POL(0) = 0

POL(nil) = 0

POL(fst(x₁, x₂)) = 1 + x₁ + x₂

POL(s(x₁)) = x₁

POL(n__len(x₁)) = x₁

POL(n__add(x₁, x₂)) = x₁ + x₂

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

ACTIVATE(x₁) -> ACTIVATE(x₁)
n_{_fst}(x₁, x₂) -> n_{_fst}(x₁, x₂)
n_{_len}(x₁) -> n_{_len}(x₁)
LEN(x₁) -> LEN(x₁)
activate(x₁) -> activate(x₁)
n_{_add}(x₁, x₂) -> n_{_add}(x₁, x₂)
cons(x₁, x₂) -> x₂
n_{_from}(x₁) -> n_{_from}(x₁)
fst(x₁, x₂) -> fst(x₁, x₂)
from(x₁) -> from(x₁)
n_{_s}(x₁) -> n_{_s}(x₁)
s(x₁) -> s(x₁)
add(x₁, x₂) -> add(x₁, x₂)
len(x₁) -> len(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 2

             ↳Argument Filtering and Ordering

Dependency Pairs:

Rules:

fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
s(X) -> n_{_s}(X)
activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_len}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_len}(X)) -> LEN(activate(X))

The following usable rules for innermost can be oriented:

activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
s(X) -> n_{_s}(X)

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(activate(x₁)) = x₁

POL(len(x₁)) = 1 + x₁

POL(LEN(x₁)) = x₁

POL(n__s) = 0

POL(ACTIVATE(x₁)) = x₁

POL(add(x₁, x₂)) = x₁ + x₂

POL(n__from(x₁)) = x₁

POL(0) = 0

POL(cons(x₁, x₂)) = x₁ + x₂

POL(nil) = 0

POL(s) = 0

POL(n__len(x₁)) = 1 + x₁

POL(n__add(x₁, x₂)) = x₁ + x₂

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

ACTIVATE(x₁) -> ACTIVATE(x₁)
LEN(x₁) -> LEN(x₁)
n_{_len}(x₁) -> n_{_len}(x₁)
activate(x₁) -> activate(x₁)
n_{_add}(x₁, x₂) -> n_{_add}(x₁, x₂)
cons(x₁, x₂) -> cons(x₁, x₂)
n_{_from}(x₁) -> n_{_from}(x₁)
n_{_fst}(x₁, x₂) -> x₂
fst(x₁, x₂) -> x₂
from(x₁) -> from(x₁)
n_{_s}(x₁) -> n_{_s}
s(x₁) -> s
add(x₁, x₂) -> add(x₁, x₂)
len(x₁) -> len(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 2

             ↳AFS

...

               →DP Problem 3

                 ↳Dependency Graph

Dependency Pairs:

ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
LEN(cons(X, Z)) -> ACTIVATE(Z)

Rules:

fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
s(X) -> n_{_s}(X)
activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X

Strategy:

innermost

Using the Dependency Graph the DP problem was split into 1 DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 2

             ↳AFS

...

               →DP Problem 4

                 ↳Argument Filtering and Ordering

Dependency Pairs:

ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X2)

Rules:

fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
s(X) -> n_{_s}(X)
activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X2)

There are no usable rules for innermost that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__from(x₁)) = x₁

POL(ACTIVATE(x₁)) = x₁

POL(n__add(x₁, x₂)) = 1 + x₁ + x₂

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

ACTIVATE(x₁) -> ACTIVATE(x₁)
n_{_add}(x₁, x₂) -> n_{_add}(x₁, x₂)
n_{_from}(x₁) -> n_{_from}(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 2

             ↳AFS

...

               →DP Problem 5

                 ↳Argument Filtering and Ordering

Dependency Pair:

ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)

Rules:

fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
s(X) -> n_{_s}(X)
activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pair can be strictly oriented:

ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)

There are no usable rules for innermost that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__from(x₁)) = 1 + x₁

POL(ACTIVATE(x₁)) = x₁

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

ACTIVATE(x₁) -> ACTIVATE(x₁)
n_{_from}(x₁) -> n_{_from}(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 2

             ↳AFS

...

               →DP Problem 6

                 ↳Dependency Graph

Dependency Pair:

Rules:

fst(0, Z) -> nil
fst(s(X), cons(Y, Z)) -> cons(Y, n_{_fst}(activate(X), activate(Z)))
fst(X1, X2) -> n_{_fst}(X1, X2)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
add(0, X) -> X
add(s(X), Y) -> s(n_{_add}(activate(X), Y))
add(X1, X2) -> n_{_add}(X1, X2)
len(nil) -> 0
len(cons(X, Z)) -> s(n_{_len}(activate(Z)))
len(X) -> n_{_len}(X)
s(X) -> n_{_s}(X)
activate(n_{_fst}(X1, X2)) -> fst(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), activate(X2))
activate(n_{_len}(X)) -> len(activate(X))
activate(X) -> X

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:20 minutes

POL(from(x₁))	= x₁
POL(activate(x₁))	= x₁
POL(len(x₁))	= x₁
POL(n__fst(x₁, x₂))	= 1 + x₁ + x₂
POL(LEN(x₁))	= x₁
POL(n__s(x₁))	= x₁
POL(ACTIVATE(x₁))	= x₁
POL(add(x₁, x₂))	= x₁ + x₂
POL(n__from(x₁))	= x₁
POL(0)	= 0
POL(nil)	= 0
POL(fst(x₁, x₂))	= 1 + x₁ + x₂
POL(s(x₁))	= x₁
POL(n__len(x₁))	= x₁
POL(n__add(x₁, x₂))	= x₁ + x₂

POL(n__from(x₁))	= 1 + x₁
POL(ACTIVATE(x₁))	= x₁