Home | • | Intro | • | Rules & Submission | • | Participants | • | Results | • | Tools | • | Specs | • | Travel Grants | • | Thanks | • | SMT-LIB | • | Previous |
---|
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 30 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.
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) 25% easy-sat, 25% easy-unsat, 25% hard-sat, and 25% hard-unsat. A benchmark is easy if it has difficulty 0, 1, or 2. A benchmark is hard if it has difficulty 3, 4, or 5.
If there aren't enough random and crafted, then the slack is “inherited” by the industrial category. It there aren't enough industrial, then the slack is “inherited” by the crafted category.
In QF_UFLRA there are only random benchmarks; in this case random benchmarks are allocated all 200 slots.
More detail on this procedure is included in a comment at the top of the source file.
Home | • | Intro | • | Rules & Submission | • | Participants | • | Results | • | Tools | • | Specs | • | Travel Grants | • | Thanks | • | SMT-LIB | • | Previous |
---|