Term Rewriting System R:
[X, Y, Z, X1, X2]
2nd(cons(X, ncons(Y, Z))) -> activate(Y)
from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
cons(X1, X2) -> ncons(X1, X2)
activate(ncons(X1, X2)) -> cons(X1, X2)
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:

2ND(cons(X, ncons(Y, Z))) -> ACTIVATE(Y)
FROM(X) -> CONS(X, nfrom(s(X)))
ACTIVATE(ncons(X1, X2)) -> CONS(X1, X2)
ACTIVATE(nfrom(X)) -> FROM(X)

R contains no SCCs.

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