Certified UNSAT
- All participants in the Main track of this competition are required to output certificates of unsatisfiablity. - Certificates of unsatisfiability have been required for the UNSAT tracks since SAT Competition 2013. - As of SAT Competition 2023, participants can select from several proof systems and formats. -- The following proof checkers are provided and described in the respective documents. +
Output Format
+ All solver output on stdout must either be a comment line, a solution line, or a value line. + Comment lines start with a lower case "c" followed by a space. + Comments are optional and may appear anywhere in the solver output. + The solution line is mandatory and must appear exactly once. + The solution line starts with a lower case "s" followed by a space. + It must be one of the following answers: +-
+
- s SATISFIABLE
+ This indicates that the solver has found a model of the formula. + In such a case, if the track requires satisfying assignments, one or multiple value lines are mandatory. +
+ - s UNSATISFIABLE
+ This indicates that the solver has proof that the formula has no model. + In such a case, if the track requires UNSAT certificates, the proof must be written to a file called "proof.out", which is then passed to the verifier. +
+ - s UNKNOWN
+ This line must be output in any other case, i.e. when the solver is not able to tell anything about the formula. +
+
Satisfying Assignment
+ Value lines start with a lower case "v" followed by a space and must be ended by a "0" zero. + Values are given as a space-separated list of non-contradictory literals. + The negation of a literal is denoted by a minus sign immediately followed by the identifier of the variable. + Value lines provide a model (or an implicant) of the instance, and it is NOT necessary to list the literals corresponding to all variables if a smaller amount of literals suffices to satisfy all clauses. + The order of the literals does not matter. + More than one value line is allowed and even necessary if the output would otherwise exceed the maximum line length of 4096 characters. + +Certificates of Unsatisfiablity
+ All participants in the Main track of this competition are required to output certificates of unsatisfiablity which must be written to a file called "proof.out". + Participants can select from the following proof checkers, which are described in the respective documents.-
Verified LRAT and LPR Proof Checking with cake_lpr
diff --git a/rules.html b/rules.html
index 2b35e3f..d20bc1d 100644
--- a/rules.html
+++ b/rules.html
@@ -18,20 +18,13 @@
Mandatory participation requirements for SAT solvers
--
-
- 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.
+
-
+
- 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. -
- A 1-2 page system description document (see below for details). +
- A system description document must be submitted with your registration e-mail. The co-authors of a solver in the system description document must match the co-authors listed in your registration e-mail. -
- The co-authors of a solver in the solver description must match the co-authors listed in the submission system. - -
- 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. - -
- 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. +
- + Printing a model in case of a satisfiable instance is required for all tracks expect for "No-limits". Additionally, UNSAT certificates (proofs) are required for the Main track.
-
Each Main Track participant (team) is required to submit 20 new benchmark instances (not seen in previous competitions).
@@ -40,10 +33,10 @@
Mandatory participation requirements for SAT solvers
StarExec cluster). See the benchmarks page for more information.
-
System Description Document
+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 @@ -58,42 +51,43 @@
System Description Document
Computer Science, University of Helsinki (with ISSN and ISBN numbers). -Your E-mail to the Organizers
+Solver Registration
- In your registration e-mail to the organizers, please include the following information: -
-
+ Your registration e-mail to the organizers should include the following:
+
- the name of the solver
- the name(s) of the solver author(s)
- the tracks in which the solver is to participate -
- the benchmarks or a link to the benchmarks (if applicable) -
- the proof checker to be used for checking unsat proofs (if applicable) -
- attach the solver description document -
- attach the benchmark description document (if applicable) -
- the solver description document
+- if applicable, the benchmarks or a link to the benchmarks, and the benchmark description document
+- if applicable, the proof checker to be used for checking unsat proofs
+ --Composition of Solvers
+ +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, + Pure Portfolios 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, solver compositions 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. + Exempted from this rule are solvers which are singularly and completely written by the author(s). + If the copyright allows for this, 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. However, doing it as a courtesy is encouraged, - when this does not interfere with the maximal permitted solvers by the authors. + 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.
+ +Number of submissions
- The limitations for compositions of solvers do not hold for solvers in the Cloud Track. + 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. + Authors can select per solver whether to participate in a track or not.
-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. -
- 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.
+