k9e_cert.py: find/check K9-e linking certificates (Paper 68 Lemma 1 (1),(2)). check needs CaDiCaL and drat-trim;
set paths at the top of the file (CADICAL, DRATTRIM). find imports k9e.py (same directory).
  python3 k9e_cert.py check control_rep34cone_both.cert.json   -> valid: true
survivors_r2.json: six split graphs H (H_edges) and their cones (cone_g6, cone_edges). Entry i=26 (cone 35/197) is a
subgraph of the other five. survivors_r2_check.json: colourability, b, slacks, tight-local.
Exact deciders (Schnyder, faces, CEGAR) on cone(H_26): each TIMEOUT at 900 s. No biplanarity claim.
