Termination proof
1: switching to dependency pairs
The following set of initial dependency pairs has been identified.
|
zprimes#
|
→ |
sieve#(
nats(
s(
s(
0
)
)
)
)
|
|
zprimes#
|
→ |
nats#(
s(
s(
0
)
)
)
|
1.1: dependency graph processor
The dependency pairs are split into 0 component(s).