generated from satcompetition/template
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
95 lines (88 loc) · 5.54 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>SAT Competition</title>
<link rel="stylesheet" href="main.css" type="text/css">
<link rel="icon" type="image/x-icon" href="doge2.ico">
<script src="https://www.w3schools.com/lib/w3.js"></script>
<style>a#index { color:var(--link-color-2); }</style>
</head>
<body>
<div class="main">
<div class="navigation" w3-include-html="navigation.html"></div>
<div class="heading" w3-include-html="heading.html"></div>
<script>w3.includeHTML();</script>
<div class="content">
SAT Competition 2022 is a competitive event for solvers of the Boolean Satisfiability (SAT) problem.
It is organized as a satellite event to the
<a href="http://satisfiability.org/SAT22/">SAT Conference 2022</a>
and stands in the tradition of the annual <a href="http://www.satcompetition.org">SAT Competitions and SAT-Races / Challenges</a>.
<h3><a name="Objective">Objective</a></h3>
<p>
The area of SAT Solving has seen tremendous progress over the last years.
Many problems (e.g. in hardware and software verification) that seemed to be completely 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.
</p>
<p>
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.
</p>
<p>
Researchers from both academia and industry are invited to submit their solvers and benchmarks to SAT Competition 2022.
</p>
<h3 id="news">News</h3>
<ul>
<li>2022-09-07, For <a href="https://www.starexec.org">StarExec</a> Users: The new sub-space "SAT/Benchmarks" contains the benchmark sets from Main tracks 2019 - 2022 and from Anniversary track 2022</li>
<li>2022-09-01, The benchmarks of the <a href="https://benchmark-database.de/getinstances?track=main_2022">Main track</a> and of the <a href="https://benchmark-database.de/getinstances?track=anni_2022">Anniversary track</a> are now available for <a href='downloads.html' id='downloads'>download</a>.</li>
<li>2022-09-01, The sources of the <a href="downloads/sequential-solvers.zip">sequential</a> and <a href="downloads/parallel-solvers.zip">parallel solvers</a> are now available for <a href='downloads.html' id='downloads'>download</a>.</li>
<li>2022-08-25, <a href="http://hdl.handle.net/10138/359079">The Proceedings of SAT Competitions 2022 are online!</a></li>
<li>2022-08-18, We have a new winner to announce in this competition: The winner of the Cadical Hack track is Norbert Manthey with his solver <b>Cadical-watchsat-lto</b>. The reason for this late announcement is that many Cadical hacks have not been announced in the submission emails but only in the solver descriptions. In the future, we will provide clearer instructions on what has to be announced in the submission email.</li>
<li><strike>2022-08-12, A draft version of the <a href='downloads/sc2022-proceedings-DRAFT-outdated.pdf'>Proceedings of SAT Competition 2022</a> is now online for inspection by the authors of the various solver and benchmark descriptions.</strike></li>
<li>2022-08-10, The <a href='results.html' id='results'>results</a> are online and the <a href="downloads/sc2022-detailed-results.zip">detailed results</a> can be downloaded.</li>
<li>2022-08-06, Call for Action: Dear winners of the SAT competition, in order to receive your medal(s), please send your contact details ASAP to <a href="mailto: markus.iser@kit.edu">Markus Iser</a>. The mail addresses will be forwarded to <a href="https://www.cas.de/en/">CAS</a> who sponsor the prices and will take care of dispatching them. You'll receive a package, including your FLOC medals.</li>
<li>2022-08-06, <a href="slides/satcomp22slides.pdf">Presentation of Results</a></li>
<li>2022-04-28, Please also indicate which of your submissions should be part of the <a href="tracks.html#anniversary">Anniversary track</a> (whether it is a subset of your regular submissions or separate)</li>
<li>2022-04-27, On StarExec <a href="starexec.html#testing">use the new preprocessor xcat to decompress benchmarks</a></li>
<li>2022-04-26, Clarified and extended rules on <a href="rules.html#num">number of submissions</a></li>
</ul>
<h3><a name="Tracks">Tracks</a></h3>
<p>
SAT Competition 2022 will consist of the following tracks*:
</p>
<ul>
<li><a href="tracks.html#main">Main Track</a>
(with <a href="tracks.html#hack">CaDiCaL Hack</a> subtrack
and <a href="tracks.html#nolimits">No Limits</a> evaluation)</li>
<li><a href="tracks.html#anniversary">Anniversary Track</a>: 20 Years of SAT Competition!</li>
<li><a href="tracks.html#parallel">Parallel Track</a></li>
<li><a href="tracks.html#cloud">Cloud Track</a></li>
</ul>
<p>* Tracks with less than 3 participants will be canceled.</p>
<h3>Important Dates</h3>
<table>
<tr>
<td>Registration Opens:</td>
<td class="date">2022-03-01</td>
</tr>
<tr>
<td>Benchmark Submission / Registration Deadline</td>
<td class="date"><strike>2022-04-01</strike> 2022-05-01 (firm)</td>
</tr>
<tr>
<td>Sequential Solver Submission Deadline:</td>
<td class="date"><strike>2022-04-15</strike> 2022-05-15 (firm)</td>
</tr>
</tr>
<tr>
<td>Parallel and Cloud Solver Submission Deadline:</td>
<td class="date"><strike>2022-05-15</strike> 2022-05-27 (firm)</td>
</tr>
<tr>
<td>Announcement of Results:</td>
<td>At SAT Conference 2022</td>
</tr>
</table>
</div>
</div>
</body>
</html>