The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LIA logic in the Parallel Track.
Page generated on 2022-08-10 14:49:55 +0000
Benchmarks: 26 Time Limit: 1200 seconds Memory Limit: N/A GB
This track is experimental. Solvers are only ranked by performance, but no winner is selected.
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
SMTS cube-and-conquer (fixed) | 11 | 14 | 11059.76 | 14 | 13 | 1 | 12 | 0 | 0 |
SMTS cube-and-conquer | 12 | 14 | 13501.866 | 14 | 14 | 0 | 12 | 0 | 0 |
SMTS portfolio | 12 | 13 | 14524.144 | 13 | 13 | 0 | 13 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
SMTS cube-and-conquer (fixed) | 3 | 13 | 7099.819 | 13 | 13 | 0 | 7 | 6 | 0 | 0 |
SMTS cube-and-conquer | 6 | 14 | 8540.053 | 14 | 14 | 0 | 6 | 6 | 0 | 0 |
SMTS portfolio | 6 | 13 | 9559.219 | 13 | 13 | 0 | 7 | 6 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
SMTS cube-and-conquer | 6 | 0 | 4961.813 | 0 | 0 | 0 | 6 | 20 | 0 | 0 |
SMTS portfolio | 6 | 0 | 4964.925 | 0 | 0 | 0 | 6 | 20 | 0 | 0 |
SMTS cube-and-conquer (fixed) | 8 | 1 | 3959.941 | 1 | 0 | 1 | 5 | 20 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
SMTS portfolio | 0 | 9 | 514.415 | 9 | 9 | 0 | 17 | 17 | 0 |
SMTS cube-and-conquer | 0 | 6 | 543.44 | 6 | 6 | 0 | 20 | 20 | 0 |
SMTS cube-and-conquer (fixed) | 0 | 5 | 547.405 | 5 | 5 | 0 | 21 | 21 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.