Objective

The area of SAT Solving has seen tremendous progress over the last years. Many problems that seemed to be out of reach a decade ago can now be handled routinely. Besides new algorithms and better heuristics, refined implementation techniques turned out to be vital for this success. To keep up the driving force in improving SAT solvers, we want to motivate implementers to present their work to a broader audience and to compare it with that of others. Researchers from both academia and industry are invited to submit their solvers and benchmarks.

News

• 2024-08-27 A separate download of the benchmark metadata is now available.
• 2024-08-27 The benchmarks are available for download at Zenodo and can be accessed in annotated form under https://benchmark-database.de?track=main_2024
• 2024-08-27 The sources of sequential solvers, parallel solvers, and distributed solvers are available for download.
• 2024-08-27 The HTML result tables of the SAT Competition 2024 are available and the detailed results can be downloaded.
• 2024-08-25 The Proceedings of the SAT Competition are available online.
• 2024-08-25 The presentation of results is now available for download.
• 2024-01-26 We will replace the satisfying assignments checker that has traditionally been used in SAT competitions. This will allow partial models to be accepted as long as every clause of the original SAT instance is satisfied.
• 2024-01-22 The competition website is online.

Tracks

• Main Track, including subtracks:
  • CaDiCaL Hack Track
  • No-limits Track
• Parallel Track
• Cloud Track

Important Dates