The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBV logic in the Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 24 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| Bitwuzla | Bitwuzla |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla Fixedn | 0 | 16 | 711.05 | 711.089 | 0 | 0 |
| Bitwuzla | 0 | 16 | 723.164 | 723.369 | 0 | 0 |
| cvc5 | 0 | 11 | 2442.483 | 2443.127 | 12 | 0 |
| Yices2 | 0 | 5 | 2375.556 | 2376.207 | 4 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla Fixedn | 0 | 16 | 711.05 | 711.089 | 0 | 0 |
| Bitwuzla | 0 | 16 | 723.164 | 723.369 | 0 | 0 |
| cvc5 | 0 | 11 | 2442.483 | 2443.127 | 12 | 0 |
| Yices2 | 0 | 5 | 2375.556 | 2376.207 | 4 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.