The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LRA logic in the Parallel Track.
Page generated on 2022-08-10 14:49:55 +0000
Benchmarks: 18 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 | 2 | 15 | 6964.393 | 15 | 4 | 11 | 4 | 0 | 0 |
SMTS cube-and-conquer | 2 | 15 | 7582.537 | 15 | 4 | 11 | 4 | 0 | 0 |
SMTS cube-and-conquer (fixed) | 3 | 16 | 3952.842 | 16 | 3 | 13 | 3 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
SMTS portfolio | 2 | 4 | 3744.225 | 4 | 4 | 0 | 2 | 12 | 0 | 0 |
SMTS cube-and-conquer | 2 | 4 | 3955.956 | 4 | 4 | 0 | 2 | 12 | 0 | 0 |
SMTS cube-and-conquer (fixed) | 2 | 3 | 2969.69 | 3 | 3 | 0 | 3 | 12 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
SMTS portfolio | 0 | 11 | 3220.168 | 11 | 0 | 11 | 2 | 5 | 0 | 0 |
SMTS cube-and-conquer | 0 | 11 | 3626.581 | 11 | 0 | 11 | 2 | 5 | 0 | 0 |
SMTS cube-and-conquer (fixed) | 1 | 13 | 983.152 | 13 | 0 | 13 | 0 | 5 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
SMTS portfolio | 0 | 6 | 391.569 | 6 | 2 | 4 | 13 | 13 | 0 |
SMTS cube-and-conquer | 0 | 4 | 393.105 | 4 | 2 | 2 | 15 | 15 | 0 |
SMTS cube-and-conquer (fixed) | 1 | 7 | 366.233 | 7 | 2 | 5 | 12 | 11 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.