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

Innermost Termination of R to be shown.



   R
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(nfrom(X)) -> FROM(X)
ACTIVATE(nfirst(X1, X2)) -> FIRST(X1, X2)

Furthermore, R contains two SCCs.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering
       →DP Problem 2
Remaining


Dependency Pairs:

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


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, nfirst(X, activate(Z)))
first(X1, X2) -> nfirst(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
activate(nfirst(X1, X2)) -> first(X1, X2)
activate(X) -> X


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
ACTIVATE(x1) -> x1
nfirst(x1, x2) -> nfirst(x1, x2)
FIRST(x1, x2) -> x2
cons(x1, x2) -> cons(x1, x2)


   R
DPs
       →DP Problem 1
AFS
           →DP Problem 3
Dependency Graph
       →DP Problem 2
Remaining


Dependency Pair:


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, nfirst(X, activate(Z)))
first(X1, X2) -> nfirst(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
activate(nfirst(X1, X2)) -> first(X1, X2)
activate(X) -> X


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
Remaining Obligation(s)




The following remains to be proven:
Dependency Pair:

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


Rules:


from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, nfirst(X, activate(Z)))
first(X1, X2) -> nfirst(X1, X2)
sel(0, cons(X, Z)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
activate(nfirst(X1, X2)) -> first(X1, X2)
activate(X) -> X


Strategy:

innermost



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