YES(?,O(n^1))
0.16/0.25	YES(?,O(n^1))
0.16/0.26	
0.16/0.26	Problem:
0.16/0.26	 filter(cons(X),0(),M) -> cons(0())
0.16/0.26	 filter(cons(X),s(N),M) -> cons(X)
0.16/0.26	 sieve(cons(0())) -> cons(0())
0.16/0.26	 sieve(cons(s(N))) -> cons(s(N))
0.16/0.26	 nats(N) -> cons(N)
0.16/0.26	 zprimes() -> sieve(nats(s(s(0()))))
0.16/0.26	
0.16/0.26	Proof:
0.16/0.26	 Bounds Processor:
0.16/0.26	  bound: 2
0.16/0.26	  enrichment: match
0.16/0.26	  automaton:
0.16/0.26	   final states: {8}
0.16/0.26	   transitions:
0.16/0.26	    sieve1(13) -> 8*
0.16/0.26	    nats1(12) -> 13*
0.16/0.26	    s1(10) -> 11*
0.16/0.26	    s1(11) -> 12*
0.16/0.26	    s1(8) -> 8*
0.16/0.26	    01() -> 10*
0.16/0.26	    cons1(10) -> 8*
0.16/0.26	    cons1(8) -> 8*
0.16/0.26	    cons2(12) -> 13*
0.16/0.26	    cons2(14) -> 8*
0.16/0.26	    s2(11) -> 14*
0.16/0.26	    filter0(8,8,8) -> 8*
0.16/0.26	    cons0(8) -> 8*
0.16/0.26	    00() -> 8*
0.16/0.26	    s0(8) -> 8*
0.16/0.26	    sieve0(8) -> 8*
0.16/0.26	    nats0(8) -> 8*
0.16/0.26	    zprimes0() -> 8*
0.16/0.26	  problem:
0.16/0.26	   
0.16/0.26	  Qed
0.16/0.26	EOF