# Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer

```@inproceedings{Heule2016SolvingAV,
title={Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer},
author={Marijn J. H. Heule and Oliver Kullmann and Victor W. Marek},
booktitle={SAT},
year={2016}
}```
• Published in SAT 3 May 2016
• Mathematics
The boolean Pythagorean Triples problem has been a longstanding open problem in Ramsey Theory: Can the set N = \$\{1, 2, ...\}\$ of natural numbers be divided into two parts, such that no part contains a triple \$(a,b,c)\$ with \$a^2 + b^2 = c^2\$ ? A prize for the solution was offered by Ronald Graham over two decades ago. We solve this problem, proving in fact the impossibility, by using the Cube-and-Conquer paradigm, a hybrid SAT method for hard problems, employing both look-ahead and CDCL…
164 Citations
Formally Proving the Boolean Pythagorean Triples Conjecture
• Mathematics, Computer Science
LPAR
• 2017
This work formalizes the Boolean Pythagorean Triples problem in Coq, recursively defining a family of propositional formulas, parameterized on a natural number n, and showing that unsatisfiability of this formula for any particular n implies that there does not exist a solution to the problem.
Cube-and-Conquer for Satisfiability
• Computer Science
Handbook of Parallel Constraint Reasoning
• 2018
This chapter presents the cube-and-conquer paradigm, a competitive alternative for solving SAT problems in parallel which outperforms both lookahead and conflict-driven solvers and achieves linear-time speedups on this problem even when using thousands of cores.
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem
• Computer Science
Journal of Automated Reasoning
• 2018
This work state the Boolean Pythagorean Triples problem in Coq, define its encoding as a propositional formula and establish the relation between solutions to the problem and satisfying assignments to the formula.
Everything's Bigger in Texas: "The Largest Math Proof Ever"
The Boolean Pythagorean triples problem is answered by encoding it into propositional logic and applying massive parallel SAT solving on the resulting formula, and a proof of the solution is produced, called the “largest math proof ever”.
Schur Number Five
A proof of the solution of a century-old problem, known as Schur Number Five, is constructed and validated using a formally verified proof checker, demonstrating that any result by satisfiability solvers can now be validated using highly trustworthy systems.
A SAT + CAS Verifier for Combinatorial Conjectures
• Mathematics, Computer Science
• 2018
Using MATHCHECK2, a combination of a SAT solver and a computer algebra system aimed at finitely verifying or counterexampling mathematical conjectures, the Hadamard conjecture was verified from design theory and independent verification of the claim that Williamson matrices of order 35 do not exist is provided.
Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing
• Mathematics
IJCAR
• 2018
A method is described for solving some open problems in design theory based on SAT solvers by using an incremental search strategy to find a maximum number of disjoint idempotent quasigroups, thus deciding the non-existence of large sets.
Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures
• Mathematics, Computer Science
Journal of Automated Reasoning
• 2016
This paper presents a method and an associated system, called MathCheck, that embeds the functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven clause-learning SAT solver, and leverages the capabilities of several different CAS, namely the SAGE, Maple, and Magma systems.
The SAT+CAS method for combinatorial search with applications to best matrices
• Mathematics, Computer Science
Annals of Mathematics and Artificial Intelligence
• 2019
An overview of the SAT+CAS method that combines satisfiability checkers (SAT solvers) and computer algebra systems (CAS) to resolve combinatorial conjectures, and present new results vis-à-vis best matrices.
Proof Search and the Structure of Solution Spaces
In 2019, Moritz Müller and I resolved a longstanding open question on the computational complexity of proof search. The preliminary version of the article “Automating Resolution is NP-Hard” was the