Term Rewriting System R:
[X, Y, Z]
from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
activate(X) -> X

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Narrowing Transformation


Dependency Pair:

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


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
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))
two new Dependency Pairs are created:

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

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Narrowing Transformation


Dependency Pairs:

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


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
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, nfrom(X''))) -> SEL(X, from(X''))
two new Dependency Pairs are created:

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

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 3
                 ↳Forward Instantiation Transformation


Dependency Pairs:

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


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
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')
two 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'', nfrom(X''''')))) -> SEL(s(X''), cons(Y'', nfrom(X''''')))

The transformation is resulting in two new DP problems: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 4
                 ↳Argument Filtering and Ordering


Dependency Pair:

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


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
activate(X) -> X


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(n__from)=  0  
  POL(SEL(x1, x2))=  x1 + x2  
  POL(s(x1))=  1 + x1  

resulting in one new DP problem.
Used Argument Filtering System:
SEL(x1, x2) -> SEL(x1, x2)
s(x1) -> s(x1)
cons(x1, x2) -> x2
nfrom(x1) -> nfrom


   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 6
                 ↳Dependency Graph


Dependency Pair:


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
activate(X) -> X


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 5
                 ↳Argument Filtering and Ordering


Dependency Pair:

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


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
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 AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(SEL(x1, x2))=  1 + x1 + x2  
  POL(cons(x1, x2))=  x1 + x2  
  POL(s(x1))=  1 + x1  

resulting in one new DP problem.
Used Argument Filtering System:
SEL(x1, x2) -> SEL(x1, x2)
s(x1) -> s(x1)
cons(x1, x2) -> cons(x1, x2)

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