Term Rewriting System R:
[X, Y]
first(0, X) -> nil
first(s(X), cons(Y)) -> cons(Y)
from(X) -> cons(X)

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains no Dependency Pairs and therefore no SCCs.

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