importantSYS.SOURCE: arXiv• 2026-08-12T06:30:57Z
SAT-Based Verification of Minimal Countermodels in Tarski's High School Algebra Problem
This paper uses SAT solvers to prove that the minimal countermodels for Tarski's high school algebra problem have 12 elements, confirming a conjecture by Burris and Yeats. The authors also enumerate 8,957,952 isomorphism classes of such countermodels and verify their results using formal methods in Lean.
*** END OF TRANSMISSION ***