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

Innermost 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

         ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳Nar

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

Strategy:

innermost

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

FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 3

             ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

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

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

Strategy:

innermost

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

ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 3

             ↳FwdInst

...

               →DP Problem 4

                 ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

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

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

Strategy:

innermost

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

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

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 3

             ↳FwdInst

...

               →DP Problem 5

                 ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

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

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

Strategy:

innermost

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

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

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 3

             ↳FwdInst

...

               →DP Problem 6

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Nar

Dependency Pairs:

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

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

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(FIRST(x₁, x₂)) = x₂

POL(s(x₁)) = 0

POL(ACTIVATE(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 3

             ↳FwdInst

...

               →DP Problem 7

                 ↳Dependency Graph

       →DP Problem 2

         ↳Nar

Dependency Pair:

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

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

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Narrowing Transformation

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

Strategy:

innermost

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

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

three new Dependency Pairs are created:

SEL(s(X), cons(Y, n_{_from}(X''))) -> SEL(X, from(X''))
SEL(s(X), cons(Y, n_{_first}(X1', X2'))) -> SEL(X, first(X1', X2'))
SEL(s(X), cons(Y, Z')) -> SEL(X, Z')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 8

             ↳Narrowing Transformation

Dependency Pairs:

SEL(s(X), cons(Y, Z')) -> SEL(X, Z')
SEL(s(X), cons(Y, n_{_first}(X1', X2'))) -> SEL(X, first(X1', X2'))
SEL(s(X), cons(Y, n_{_from}(X''))) -> SEL(X, from(X''))

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

Strategy:

innermost

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

SEL(s(X), cons(Y, n_{_from}(X''))) -> SEL(X, from(X''))

two new Dependency Pairs are created:

SEL(s(X), cons(Y, n_{_from}(X'''))) -> SEL(X, cons(X''', n_{_from}(s(X'''))))
SEL(s(X), cons(Y, n_{_from}(X'''))) -> SEL(X, n_{_from}(X'''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 8

             ↳Nar

...

               →DP Problem 9

                 ↳Narrowing Transformation

Dependency Pairs:

SEL(s(X), cons(Y, n_{_from}(X'''))) -> SEL(X, cons(X''', n_{_from}(s(X'''))))
SEL(s(X), cons(Y, n_{_first}(X1', X2'))) -> SEL(X, first(X1', X2'))
SEL(s(X), cons(Y, Z')) -> SEL(X, 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

Strategy:

innermost

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

SEL(s(X), cons(Y, n_{_first}(X1', X2'))) -> SEL(X, first(X1', X2'))

three new Dependency Pairs are created:

SEL(s(X), cons(Y, n_{_first}(0, X2''))) -> SEL(X, nil)
SEL(s(X), cons(Y, n_{_first}(s(X''), cons(Y'', Z')))) -> SEL(X, cons(Y'', n_{_first}(X'', activate(Z'))))
SEL(s(X), cons(Y, n_{_first}(X1'', X2''))) -> SEL(X, n_{_first}(X1'', X2''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 8

             ↳Nar

...

               →DP Problem 10

                 ↳Forward Instantiation Transformation

Dependency Pairs:

SEL(s(X), cons(Y, n_{_first}(s(X''), cons(Y'', Z')))) -> SEL(X, cons(Y'', n_{_first}(X'', activate(Z'))))
SEL(s(X), cons(Y, Z')) -> SEL(X, Z')
SEL(s(X), cons(Y, n_{_from}(X'''))) -> SEL(X, cons(X''', n_{_from}(s(X'''))))

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

Strategy:

innermost

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

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

three new Dependency Pairs are created:

SEL(s(s(X'')), cons(Y, cons(Y'', Z'''))) -> SEL(s(X''), cons(Y'', Z'''))
SEL(s(s(X'')), cons(Y, cons(Y'', n_{_from}(X''''')))) -> SEL(s(X''), cons(Y'', n_{_from}(X''''')))
SEL(s(s(X'')), cons(Y, cons(Y'', n_{_first}(s(X''''), cons(Y'''', Z'''))))) -> SEL(s(X''), cons(Y'', n_{_first}(s(X''''), cons(Y'''', Z'''))))

The transformation is resulting in three new DP problems:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 8

             ↳Nar

...

               →DP Problem 11

                 ↳Polynomial Ordering

Dependency Pair:

SEL(s(X), cons(Y, n_{_first}(s(X''), cons(Y'', Z')))) -> SEL(X, cons(Y'', n_{_first}(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

Strategy:

innermost

The following dependency pair can be strictly oriented:

SEL(s(X), cons(Y, n_{_first}(s(X''), cons(Y'', Z')))) -> SEL(X, cons(Y'', n_{_first}(X'', activate(Z'))))

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__from(x₁)) = 0

POL(from(x₁)) = 0

POL(activate(x₁)) = 0

POL(first(x₁, x₂)) = 0

POL(0) = 0

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

POL(SEL(x₁, x₂)) = x₁

POL(nil) = 0

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

POL(n__first(x₁, x₂)) = 0

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 8

             ↳Nar

...

               →DP Problem 14

                 ↳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

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 8

             ↳Nar

...

               →DP Problem 12

                 ↳Polynomial Ordering

Dependency Pair:

SEL(s(X), cons(Y, n_{_from}(X'''))) -> SEL(X, cons(X''', n_{_from}(s(X'''))))

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

Strategy:

innermost

The following dependency pair can be strictly oriented:

SEL(s(X), cons(Y, n_{_from}(X'''))) -> SEL(X, cons(X''', n_{_from}(s(X'''))))

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__from(x₁)) = 0

POL(SEL(x₁, x₂)) = x₁

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 8

             ↳Nar

...

               →DP Problem 13

                 ↳Polynomial Ordering

Dependency Pair:

SEL(s(s(X'')), cons(Y, cons(Y'', Z'''))) -> SEL(s(X''), cons(Y'', 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

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(SEL(x₁, x₂)) = x₁

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

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

resulting in one new DP problem.

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

POL(cons(x₁, x₂))	= x₂
POL(FIRST(x₁, x₂))	= x₂
POL(s(x₁))	= 0
POL(ACTIVATE(x₁))	= x₁
POL(n__first(x₁, x₂))	= 1 + x₂

POL(n__from(x₁))	= 0
POL(from(x₁))	= 0
POL(activate(x₁))	= 0
POL(first(x₁, x₂))	= 0
POL(0)	= 0
POL(cons(x₁, x₂))	= 0
POL(SEL(x₁, x₂))	= x₁
POL(nil)	= 0
POL(s(x₁))	= 1 + x₁
POL(n__first(x₁, x₂))	= 0