Mandatory participation requirements for SAT solvers

  1. The source code of submitted SAT solvers must be made available (licensed for research purposes) except for the solvers participating only in the No-Limits Track.
  2. A 1-2 page system description document (see below for details).
  3. The co-authors of a solver in the solver description must match the co-authors listed in the submission system.
  4. SAT solvers must conform to DIMACS input/output requirements (see SAT Competition 2009 for details). Printing models in case of a satisfiable instance is required for all tracks expect for "no-limits". Additionally, UNSAT certificates (proofs) are required for the main tracks.
  5. SAT solvers that are planning to participate in the Main track must be able to produce certificates for UNSAT instances in tracecheck or DRAT (Delete Resolution Asymmetric Tautologies) format which is backwards compatible with the DRUP format of SAT Competition 2013.
  6. Each Main Track participant (team) is required to submit 20 new benchmark instances (not seen in previous competitions). At least 10 of those benchmarks should be "interesting": not too easy (solvable by MiniSat in a minute) or too hard (unsolvable by the participants own solver within one hour on a computer similar to the nodes of the StarExec cluster). See the benchmarks page for more information.

System Description Document

Each entrant to the SAT Competition must include a short (at least 1, at most 2 pages) description of the system. This should include a list of all authors of the system and their present institutional affiliations. It should also provide details of any non-standard algorithmic techniques (e.g., heuristics, simplification/learning techniques, etc.) and data structures, as well as references to relevant literature (be they by the authors themselves or by others). The system description must be formatted in IEEE Proceedings style, and submitted as PDF. The system descriptions will be posted on the SAT Competition website. Furthermore, given that the quality and number of system descriptions is high enough, the organizers are considering publishing the collection of system description as a report under the report series of Department of Computer Science, University of Helsinki (with ISSN and ISBN numbers).

Your E-mail to the Organizers

In your registration e-mail to the organizers, please include the following information:

  1. the name of the solver
  2. the name(s) of the solver author(s)
  3. the tracks in which the solver is to participate
  4. the benchmarks or a link to the benchmarks (if applicable)
  5. the proof checker to be used for checking unsat proofs (if applicable)
  6. attach the solver description document
  7. attach the benchmark description document (if applicable)

Composition of Solvers

SAT Competitions stimulate progress in development and implementation of core SAT solving methods. Pure Portfolio SAT solvers which are a combination of two or more (core) SAT solvers developed by different groups of authors are not allowed to participate in the competition.

Otherwise, composed solvers must have different solving methodologies, e.g., CDCL, SLS, Lookahead, Groebner Basis, etc., not just different solving strategies. Exempted from this rule are solvers which are singularly, and completely, written by the author(s).

There is no need to acquire permission to use the code or to add the original author(s) of the composed solvers to the published paper, if the copyright allows for this. However, doing it as a courtesy is encouraged, when this does not interfere with the maximal permitted solvers by the authors.

The limitations for compositions of solvers do not hold for solvers in the Cloud Track.

Qualification

There will be no qualification round, but only a testing round to ensure that solvers are running properly on the evaluation system. The test set of instances will consist in a random selection of instances from the last SAT Competitions. The organizers reserve the right to disqualify poorly performing solvers.

Disqualification

A SAT solver will be disqualified if the solver produces a wrong answer. Specifically, if a solver reports UNSAT on an instance that was proven to be SAT by some other solver, or SAT and provides a wrong certificate. A solver disqualified from the competition is not eligible to win any award. Disqualified solvers will be marked as such on the competition results page.

Note that there is a dedicated period when the participants can check their results to ensure that no problems are caused by the competition framework.

Withdrawal

A solver can be withdrawn from the SAT Competition only before the deadline for the submission of the final versions. After this deadline no further changes or withdrawals of the solvers are possible.

Participation of the organizers

The organizers of this SAT Competition are not allowed to compete.

Number of submissions

Each participant is restricted to be a co-author of at most four different sequential solvers in the Main track, one CaDiCaL hack-track submission, two different parallel solvers in the Parallel track, and one solver in the Cloud track. Two solvers are different as soon as their sources differ or the compilation options are different. Solvers are also different if they use different command line options. However, we make an exception for a command line option that enables emitting UNSAT proofs for the certified UNSAT tracks. Authors can select per solver whether to participate in a track or not.