Termination Proof using AProVE

Term Rewriting System R:
[X, Y, X1, X2, Z]
and(true, X) -> activate(X)
and(false, Y) -> false
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
add(0, X) -> activate(X)
add(s(X), Y) -> s(n_{_add}(activate(X), activate(Y)))
add(X1, X2) -> n_{_add}(X1, X2)
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(activate(Y), n_{_first}(activate(X), activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
from(X) -> cons(activate(X), n_{_from}(n_{_s}(activate(X))))
from(X) -> n_{_from}(X)
s(X) -> n_{_s}(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), X2)
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(X)
activate(n_{_s}(X)) -> s(X)
activate(X) -> X

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

AND(true, X) -> ACTIVATE(X)
IF(true, X, Y) -> ACTIVATE(X)
IF(false, X, Y) -> ACTIVATE(Y)
ADD(0, X) -> ACTIVATE(X)
ADD(s(X), Y) -> S(n_{_add}(activate(X), activate(Y)))
ADD(s(X), Y) -> ACTIVATE(X)
ADD(s(X), Y) -> ACTIVATE(Y)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Y)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(X)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)
FROM(X) -> ACTIVATE(X)
ACTIVATE(n_{_add}(X1, X2)) -> ADD(activate(X1), X2)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(activate(X1), activate(X2))
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_from}(X)) -> FROM(X)
ACTIVATE(n_{_s}(X)) -> S(X)

Furthermore, R contains one SCC.

     ↳DPs

       →DP Problem 1

         ↳Narrowing Transformation

Dependency Pairs:

FROM(X) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> FROM(X)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
ADD(0, X) -> ACTIVATE(X)
ACTIVATE(n_{_add}(X1, X2)) -> ADD(activate(X1), X2)

Rules:

and(true, X) -> activate(X)
and(false, Y) -> false
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
add(0, X) -> activate(X)
add(s(X), Y) -> s(n_{_add}(activate(X), activate(Y)))
add(X1, X2) -> n_{_add}(X1, X2)
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(activate(Y), n_{_first}(activate(X), activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
from(X) -> cons(activate(X), n_{_from}(n_{_s}(activate(X))))
from(X) -> n_{_from}(X)
s(X) -> n_{_s}(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), X2)
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(X)
activate(n_{_s}(X)) -> s(X)
activate(X) -> X

Strategy:

innermost

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

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

five new Dependency Pairs are created:

ACTIVATE(n_{_add}(n_{_add}(X1'', X2''), X2)) -> ADD(add(activate(X1''), X2''), X2)
ACTIVATE(n_{_add}(n_{_first}(X1'', X2''), X2)) -> ADD(first(activate(X1''), activate(X2'')), X2)
ACTIVATE(n_{_add}(n_{_from}(X'), X2)) -> ADD(from(X'), X2)
ACTIVATE(n_{_add}(n_{_s}(X'), X2)) -> ADD(s(X'), X2)
ACTIVATE(n_{_add}(X1', X2)) -> ADD(X1', X2)

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 2

             ↳Rewriting Transformation

Dependency Pairs:

ACTIVATE(n_{_add}(X1', X2)) -> ADD(X1', X2)
ACTIVATE(n_{_add}(n_{_s}(X'), X2)) -> ADD(s(X'), X2)
ACTIVATE(n_{_add}(n_{_from}(X'), X2)) -> ADD(from(X'), X2)
ACTIVATE(n_{_add}(n_{_first}(X1'', X2''), X2)) -> ADD(first(activate(X1''), activate(X2'')), X2)
ADD(0, X) -> ACTIVATE(X)
ACTIVATE(n_{_add}(n_{_add}(X1'', X2''), X2)) -> ADD(add(activate(X1''), X2''), X2)
ACTIVATE(n_{_from}(X)) -> FROM(X)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
FROM(X) -> ACTIVATE(X)

Rules:

and(true, X) -> activate(X)
and(false, Y) -> false
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
add(0, X) -> activate(X)
add(s(X), Y) -> s(n_{_add}(activate(X), activate(Y)))
add(X1, X2) -> n_{_add}(X1, X2)
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(activate(Y), n_{_first}(activate(X), activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
from(X) -> cons(activate(X), n_{_from}(n_{_s}(activate(X))))
from(X) -> n_{_from}(X)
s(X) -> n_{_s}(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), X2)
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(X)
activate(n_{_s}(X)) -> s(X)
activate(X) -> X

Strategy:

innermost

On this DP problem, a Rewriting SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_add}(n_{_s}(X'), X2)) -> ADD(s(X'), X2)

one new Dependency Pair is created:

ACTIVATE(n_{_add}(n_{_s}(X'), X2)) -> ADD(n_{_s}(X'), X2)

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 2

             ↳Rw

...

               →DP Problem 3

                 ↳Remaining Obligation(s)

The following remains to be proven:
Dependency Pairs:

ACTIVATE(n_{_add}(n_{_from}(X'), X2)) -> ADD(from(X'), X2)
ACTIVATE(n_{_add}(n_{_first}(X1'', X2''), X2)) -> ADD(first(activate(X1''), activate(X2'')), X2)
ACTIVATE(n_{_add}(n_{_add}(X1'', X2''), X2)) -> ADD(add(activate(X1''), X2''), X2)
FROM(X) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> FROM(X)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_add}(X1, X2)) -> ACTIVATE(X1)
ADD(0, X) -> ACTIVATE(X)
ACTIVATE(n_{_add}(X1', X2)) -> ADD(X1', X2)

Rules:

and(true, X) -> activate(X)
and(false, Y) -> false
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
add(0, X) -> activate(X)
add(s(X), Y) -> s(n_{_add}(activate(X), activate(Y)))
add(X1, X2) -> n_{_add}(X1, X2)
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(activate(Y), n_{_first}(activate(X), activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
from(X) -> cons(activate(X), n_{_from}(n_{_s}(activate(X))))
from(X) -> n_{_from}(X)
s(X) -> n_{_s}(X)
activate(n_{_add}(X1, X2)) -> add(activate(X1), X2)
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(n_{_from}(X)) -> from(X)
activate(n_{_s}(X)) -> s(X)
activate(X) -> X

Strategy:

innermost

Innermost Termination of R could not be shown.
Duration:
0:05 minutes