=========== 0019 - LEMMA 3: THE COUNTING CERTIFICATE IS VACUOUS =========== Counting certificate (Lemma 3) at n=64, R <= 1200 R cap(R) cap(R)-R 2 64 +62 3 65 +62 4 66 +62 5 67 +62 6 68 +62 1196 2447 +1251 1197 2450 +1253 1198 2453 +1255 1199 2454 +1255 1200 2456 +1256 R in [2,1200] refutable by counting alone: 0 => the counting certificate is VACUOUS; only search (and a real method) can bound the run from above.