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 2021-07-18 17:30:28 +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 |
|---|---|---|---|---|---|---|---|
| 2020-Bitwuzla-fixedn | 0 | 2839 | 2141.498 | 2111.632 | 0 | 0 | 0 |
| Bitwuzla | 0 | 2839 | 2219.468 | 2186.606 | 0 | 0 | 0 |
| 2020-Yices2 incrementaln | 0 | 2835 | 3107.695 | 3075.276 | 4 | 2 | 0 |
| Yices2 incremental | 0 | 2835 | 3107.082 | 3076.945 | 4 | 2 | 0 |
| MathSAT5n | 0 | 2707 | 7995.715 | 7958.65 | 132 | 5 | 0 |
| cvc5-inc | 0 | 2586 | 15109.569 | 15025.012 | 253 | 7 | 0 |
| z3n | 0 | 2306 | 22480.074 | 22437.349 | 533 | 12 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.