Term Rewriting System R:
[Z, Y, X]
fst(0, Z) -> nil
fst(s, cons(Y)) -> cons(Y)
from(X) -> cons(X)
add(0, X) -> X
add(s, Y) -> s
len(nil) -> 0
len(cons(X)) -> s
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