Computational artifact for "Testing the max-flow min-cut property and the replication conjecture"

This record contains the computational artifact supporting Proposition 16 of the paper "Testing the max-flow min-cut property and the replication conjecture" by Ahmad Abdi and Tamás Schwarcz. For each admissible weight function (d, tau, w), the artifact provides a CNF formula whose satisfiability is equivalent to the existence of a set-system S with the relevant properties. The proposition asserts that no such S exists; equivalently, every CNF is unsatisfiable, as the DRAT proofs certify. The CNFs were solved with CaDiCaL 3.0.0, producing DRAT proofs of unsatisfiability. This release contains general instances for dimensions d = 5, 6, 7, 8, 9 and up-monotone instances for dimension d = 10 — specifically, the CNF instances, DRAT proofs, solver metadata, verification metadata, manifests, checksums, and the scripts used to generate, solve, verify, and package the artifact. The top-level README explains the file layout, checksum procedure, regeneration of CNFs, and proof-verification commands. The code is licensed under the MIT License, and the research data and computational artifacts are licensed under CC BY 4.0.