Term Rewriting System R:
[X, Y, Z, X1]
2nd(cons1(X, cons(Y, Z))) -> Y
2nd(cons(X, X1)) -> 2nd(cons1(X, activate(X1)))
from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
activate(nfrom(X)) -> from(X)
activate(X) -> X

Innermost Termination of R to be shown.

Dependency Pair Analysis

R contains the following Dependency Pairs:

2ND(cons(X, X1)) -> 2ND(cons1(X, activate(X1)))
2ND(cons(X, X1)) -> ACTIVATE(X1)
ACTIVATE(nfrom(X)) -> FROM(X)

R contains no SCCs.

Innermost Termination of R successfully shown.
0:00 minutes