Term Rewriting System R:
[X, M, N]
filter(cons(X), 0, M) -> cons(0)
filter(cons(X), s(N), M) -> cons(X)
sieve(cons(0)) -> cons(0)
sieve(cons(s(N))) -> cons(s(N))
nats(N) -> cons(N)
zprimes -> sieve(nats(s(s(0))))

Innermost Termination of R to be shown.

Dependency Pair Analysis

R contains the following Dependency Pairs:

ZPRIMES -> SIEVE(nats(s(s(0))))
ZPRIMES -> NATS(s(s(0)))

R contains no SCCs.

Innermost Termination of R successfully shown.
0:00 minutes