Reproduce “count-catcher: Lean Theorems from Model Counting Certificates” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Johannes K. Fichte, Stefan Szeider
Count-catcher proves the exact number of order-8 Latin squares in Lean. It connects model-counting certificates from d4 and CPOG to a CNF formula represented in Lean, then uses a user-supplied encoding proof to relate formula models to squares. The authors combine 737 certified counts to establish 108,776,032,459,082,956,800, checking the result against the literature; this relies on the current d4/cpog-gen pipeline.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.