These scripts found the certificates in ../certificates.json. They are not needed to check the proof: ../verify.py checks every certificate with the Python standard library. Except for bruteforce_scan.py, they are the original exploration scripts, copied as they were. The only edits replace absolute paths with paths relative to this folder. All of them need python-sat (CaDiCaL 1.5.3), and they write their JSON output to the current directory.
dg.py,dg_run.py: for one set (python3 dg_run.py 1 3 4 5 9), compute and . Then either find a periodic proper -colouring by SAT, or show by SAT that an interval of length (or longer) has no proper -colouring. The intervals they report are not the shortest ones. The shortest ones are 13, 17 and 19, as stated in the proof and checked byverify.py.loops.py,family.py,run_family.py: loop certificates for the one-parameter families A5, A6, W2 and W3. For example,python3 run_family.py A6 7 30 50000 30takes , loop lengths up to 30 and a conflict budget of 50000. It writesfam_A6.json, containing the state, the loops, the semigroup gap and the direct colourings. Different bounds give different, equally valid certificates. Rerunning the script therefore need not reproduce the exact words incertificates.json.base_loops.py,base2.py,g2.py: loops for a fixed distance set (the base of Lemma 6), and the coverage test for the two-parameter family.g2.pyexpectsbase_1_2_3_5_7_8.jsonandbase_1_3_4_5_6_9.jsonfrombase_loops.pyorbase2.py. The second base turned out to be unnecessary.build_certs.py: assembles../certificates.jsonfromout5.txt, …,out8.txt(JSON lines written bydg_run.py, one per listed set),fam_*.jsonandbase_1_2_3_5_7_8.json. It reads the seven- and eight-speed tables from../../../results/*/sporadic.txt, so it runs only from inside the repository and only after those intermediate files have been regenerated. They are not kept here. It now writes the shortest intervals 13, 17 and 19. An earlier version wrote the first intervals tried bydg_run.py(26, 24 and 38).bruteforce_scan.pyand its outputbruteforce_scan.txt: an independent check written after the proof. It uses neither R5–R8 nor the certificates. It decides or for every primitive -set , with . A set counts as colourable when an explicit periodic colouring is found and checked directly, and as not colourable when SAT finds no colouring of some interval. The non-colourable sets in range are exactly those predicted by Theorem A. With--smallthe scan also checks the classical characterizations for three and four distances quoted in the proof, with and . Run it from this folder:python3 bruteforce_scan.py --small > bruteforce_scan.txt(about six minutes on one core).