SAT 2004 Competition: Call for Benchmarks

SAT Competition 2004

February - May, 2004

Last modification: January 30, 2003.


Who can submit?


What can be submitted?

Any instance of Boolean satisfiability problem that seems to be challenging, or a set of instances, or a benchmark generator. The format of submission is described here. The organizing committee keeps the right of Laurent Simon to reject any benchmark that

Note that the following benchmarks remained unsolved during the previous SAT2002 and SAT2003 competitions (so-called challenging benchmarks) will be submitted automatically.

We divide instances into the following three categories:

See benchmarks format specification for the details of submitting benchmarks to each category.

How to submit?

Go to the submission page!

Who are the winners?

The authors of the smallest benchmarks (in terms of the total number of literal occurrences) that were not solved by any solver will be declared winners. There will be two winners: one for a satisfiable benchmark, and one for an unsatisfiable one. We do not award benchmarks submitted as "unknown" ones.

The following benchmarks will be excluded from the consideration here:

What are the awards?

A beautiful certificate, unless some people are willing to provide prizes to motivate the competition (then please contact the organizers).

Important dates

Organizing Committee

Laurent Simon ( and Daniel Le Berre (


Competition homepage

[SAT Competition 2004] [ SAT 2004 Conference ] [ SAT-Ex] [ SATLIB] [ SAT Live!]