The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BV logic in the Parallel Track.
Page generated on 2021-07-18 17:32:11 +0000
Benchmarks: 17 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 |
|---|---|---|---|---|---|---|---|---|---|
| Par4n | 0 | 2 | 19098.118 | 2 | 0 | 2 | 15 | 15 | 0 |
| STP-parallel | 0 | 1 | 16800.01 | 1 | 0 | 1 | 16 | 14 | 0 |
| cvc5-gg | 0 | 0 | 19200.0 | 0 | 0 | 0 | 17 | 16 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| STP-parallel | 0 | 0 | 2400.0 | 0 | 0 | 0 | 4 | 13 | 14 | 0 |
| cvc5-gg | 0 | 0 | 4800.0 | 0 | 0 | 0 | 4 | 13 | 16 | 0 |
| Par4n | 0 | 0 | 4800.0 | 0 | 0 | 0 | 4 | 13 | 15 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Par4n | 0 | 2 | 9498.118 | 2 | 0 | 2 | 7 | 8 | 15 | 0 |
| STP-parallel | 0 | 1 | 9600.01 | 1 | 0 | 1 | 8 | 8 | 14 | 0 |
| cvc5-gg | 0 | 0 | 10800.0 | 0 | 0 | 0 | 9 | 8 | 16 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| STP-parallel | 0 | 1 | 336.01 | 1 | 0 | 1 | 16 | 14 | 0 |
| cvc5-gg | 0 | 0 | 384.0 | 0 | 0 | 0 | 17 | 16 | 0 |
| Par4n | 0 | 0 | 408.0 | 0 | 0 | 0 | 17 | 17 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.