The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_IDL logic in the Parallel Track.
Page generated on 2022-08-10 14:49:55 +0000
Benchmarks: 58 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 portfolio | 44 | 2 | 73212.373 | 2 | 2 | 0 | 61 | 0 | 0 |
SMTS cube-and-conquer | 44 | 2 | 73212.898 | 2 | 2 | 0 | 61 | 0 | 0 |
SMTS cube-and-conquer (fixed) | 44 | 2 | 73213.725 | 2 | 2 | 0 | 61 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
SMTS portfolio | 23 | 2 | 27612.373 | 2 | 2 | 0 | 23 | 33 | 0 | 0 |
SMTS cube-and-conquer | 23 | 2 | 27612.898 | 2 | 2 | 0 | 23 | 33 | 0 | 0 |
SMTS cube-and-conquer (fixed) | 23 | 2 | 27613.725 | 2 | 2 | 0 | 23 | 33 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
SMTS cube-and-conquer | 21 | 0 | 25200.0 | 0 | 0 | 0 | 21 | 37 | 0 | 0 |
SMTS cube-and-conquer (fixed) | 21 | 0 | 25200.0 | 0 | 0 | 0 | 21 | 37 | 0 | 0 |
SMTS portfolio | 21 | 0 | 25200.0 | 0 | 0 | 0 | 21 | 37 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
SMTS portfolio | 0 | 2 | 1476.373 | 2 | 2 | 0 | 61 | 61 | 0 |
SMTS cube-and-conquer | 0 | 2 | 1476.898 | 2 | 2 | 0 | 61 | 61 | 0 |
SMTS cube-and-conquer (fixed) | 0 | 2 | 1477.725 | 2 | 2 | 0 | 61 | 61 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.