The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
The benchmark selector used for 2012 is a slight modification of the one used for 2011.
The rules for benchmark eligibility are summraized here, but stated more completely in the rules document.
First, benchmarks that are of unknown
status are ineligible.
Benchmarks that are “too easy” are similarly ineligible. “Too easy” is understood to mean that all of last year’s solvers can solve the benchmark correctly in 5 seconds or less. However, if removing such benchmarks leaves a division with fewer than 300 eligible (non-check) benchmarks, then the easiest benchmarks are removed until 300 non-check benchmarks remain.
The organizers reserve the right to remove from competition eligibility uninteresting or over-represented benchmarks.
For each division, the check
benchmarks are always included. In addition, the selection script will randomly select 200 benchmarks from each division with the following distribution (when possible): 170 industrial
, 20 crafted
, and 10 random
.
In each category, the script selects (when possible):
sat
with difficulty on the interval [0,1].sat
with difficulty on the interval (1,2].sat
with difficulty on the interval (2,3].sat
with difficulty on the interval (3,4].sat
with difficulty on the interval (4,5].unsat
with difficulty on the interval [0,1].unsat
with difficulty on the interval (1,2].unsat
with difficulty on the interval (2,3].unsat
with difficulty on the interval (3,4].unsat
with difficulty on the interval (4,5].If there aren’t enough random
and crafted
benchmarks, then
the slack is “inherited” by the industrial
category.
It there aren’t enough industrial
benchmarks, then the slack
is “inherited” by the crafted
category.
As a last resort, and only if necessary (as in divisions with only random
benchmarks), random
benchmarks are allocated additional slots.
More detail on this procedure is included in a comment at the top of the source file. A less algorithmic description can be found in the official rules.