The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Bitvec division in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 1295 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 25272 | 29810.443 | 29742.62 | 616 | 0 | 16 | 0 |
| 2021-STPn | 0 | 25251 | 30772.876 | 20772.302 | 637 | 0 | 13 | 0 |
| MathSATn | 0 | 25186 | 42462.759 | 42262.389 | 702 | 0 | 20 | 0 |
| Bitwuzla | 0 | 25148 | 22149.446 | 21982.988 | 740 | 0 | 10 | 0 |
| STP | 0 | 25131 | 19588.176 | 19499.088 | 757 | 0 | 11 | 0 |
| cvc5 | 0 | 24967 | 78835.875 | 78697.958 | 921 | 0 | 15 | 0 |
| z3-4.8.17n | 0 | 24852 | 52005.324 | 51858.058 | 1036 | 0 | 22 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.