Organized in conjunction with SAT 2002
(the Fifth International Symposium on the
Theory and Applications of Satisfiability Testing)
Last modification: 13 June 2020: resurrected the benchmarks.
Report on the competition available:
Important: two words from Berkmin authors
Results unveiled!!!!!!!!
SAT Competition 2002 started on April 8, 2002 and will continue until (and during) SAT 2002 Symposium (May 6-9, 2002, Cincinatti, Ohio, USA).
The purpose of the competition is to identify new challenging benchmarks and to promote new solvers for the propositional satisfiability problem (SAT) as well as to compare them with state-of-the-art solvers. We strongly encourage people thinking about SAT-based techniques in their area (planning, hardware or software verification, etc.) to submit benchmarks to be used for the competition. The result of the competition will be a good indicator of the current feasibility of such approach. The competition will be completely automated using the SAT-Ex system.
To motivate participation an award of US Dollar 2500 (provided by the computational logic group at Delft) will be allocated to a selection of solvers and benchmarks with particular interest. See the Call for Solvers and Benchmarks for details.
You may also subscribe there to the mailing list that will keep you updated about the competition.