The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABV logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 636 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Bitwuzla |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 1836 | 47653.672 | 47590.647 | 30 | 27 | 0 |
| 2020-Yices2 incrementaln | 0 | 1834 | 21575.144 | 21541.209 | 32 | 14 | 0 |
| Yices2 incremental | 0 | 1834 | 21730.039 | 21644.129 | 32 | 14 | 0 |
| 2020-Bitwuzla-fixedn | 0 | 1834 | 49635.896 | 49603.335 | 32 | 29 | 0 |
| MathSAT5n | 0 | 1785 | 32198.604 | 32079.075 | 81 | 22 | 0 |
| z3n | 0 | 1619 | 206301.386 | 206293.264 | 247 | 157 | 1 |
| cvc5-inc | 0 | 1450 | 49351.634 | 49279.296 | 416 | 35 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.