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 Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 34 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| Yices2 | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Yices2 | 0 | 18192 | 930.492 | 891.73 | 3 | 0 |
| Bitwuzla | 0 | 15894 | 692.775 | 693.212 | 2 | 0 |
| Bitwuzla Fixedn | 0 | 15740 | 694.437 | 692.024 | 2 | 0 |
| 2022-Bitwuzlan | 0 | 15195 | 192.408 | 192.43 | 0 | 0 |
| cvc5 | 0 | 4427 | 24.402 | 24.391 | 9 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Yices2 | 0 | 18192 | 930.492 | 891.73 | 3 | 0 |
| Bitwuzla | 0 | 15894 | 692.775 | 693.212 | 2 | 0 |
| Bitwuzla Fixedn | 0 | 15740 | 694.437 | 692.024 | 2 | 0 |
| 2022-Bitwuzlan | 0 | 15195 | 192.408 | 192.43 | 0 | 0 |
| cvc5 | 0 | 4427 | 24.402 | 24.391 | 9 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.