The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFBV logic in the Incremental Track.
Page generated on 2022-08-10 11:18:22 +0000
Benchmarks: 1165 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 | 2766 | 2056.359 | 2028.79 | 0 | 0 | 0 |
| 2020-Yices2 incrementaln | 0 | 2760 | 2900.089 | 2871.199 | 6 | 2 | 0 |
| Yices2 | 0 | 2760 | 2911.004 | 2881.3 | 6 | 2 | 0 |
| z3-4.8.17n | 0 | 2742 | 7147.575 | 7108.866 | 24 | 4 | 0 |
| MathSATn | 0 | 2697 | 7167.739 | 7119.904 | 69 | 5 | 0 |
| cvc5 | 0 | 2652 | 15804.196 | 15689.762 | 114 | 9 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.