WORST_CASE(?, O(n^1)) filterconsX0Mcons0filterconsXsNMconsXsievecons0cons0sieveconssNconssNnatsNconsNzprimessievenatsss0cons100s1filter3sieve1nats1zprimes012.12001234cons000000s000filter00001sieve002nats003zprimes04015cons151cons101cons152s106cons162cons1030110s1109s198nats187sieve174cons287s2911cons2114AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (1 real / 0 unknown / 0 assumptions / 1 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe