0.00/0.01	YES
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	(VAR v_NonEmpty:S M:S N:S X:S)
0.00/0.01	(RULES
0.00/0.01	filter(cons(X:S),0,M:S) -> cons(0)
0.00/0.01	filter(cons(X:S),s(N:S),M:S) -> cons(X:S)
0.00/0.01	nats(N:S) -> cons(N:S)
0.00/0.01	sieve(cons(0)) -> cons(0)
0.00/0.01	sieve(cons(s(N:S))) -> cons(s(N:S))
0.00/0.01	zprimes -> sieve(nats(s(s(0))))
0.00/0.01	) 
0.00/0.01	(STRATEGY INNERMOST)
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	Dependency Pairs Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 ZPRIMES -> NATS(s(s(0)))
0.00/0.01	 ZPRIMES -> SIEVE(nats(s(s(0))))
0.00/0.01	-> Rules:
0.00/0.01	 filter(cons(X:S),0,M:S) -> cons(0)
0.00/0.01	 filter(cons(X:S),s(N:S),M:S) -> cons(X:S)
0.00/0.01	 nats(N:S) -> cons(N:S)
0.00/0.01	 sieve(cons(0)) -> cons(0)
0.00/0.01	 sieve(cons(s(N:S))) -> cons(s(N:S))
0.00/0.01	 zprimes -> sieve(nats(s(s(0))))
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	SCC Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 ZPRIMES -> NATS(s(s(0)))
0.00/0.01	 ZPRIMES -> SIEVE(nats(s(s(0))))
0.00/0.01	-> Rules:
0.00/0.01	 filter(cons(X:S),0,M:S) -> cons(0)
0.00/0.01	 filter(cons(X:S),s(N:S),M:S) -> cons(X:S)
0.00/0.01	 nats(N:S) -> cons(N:S)
0.00/0.01	 sieve(cons(0)) -> cons(0)
0.00/0.01	 sieve(cons(s(N:S))) -> cons(s(N:S))
0.00/0.01	 zprimes -> sieve(nats(s(s(0))))
0.00/0.01	->Strongly Connected Components:
0.00/0.01	 There is no strongly connected component
0.00/0.01	
0.00/0.01	The problem is finite.
0.00/0.01	EOF