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 Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 31 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 | 966 | 5058.2 | 5061.82 | 1 | 1 | 0 |
| Yices2 Fixedn | 0 | 947 | 4651.27 | 4654.51 | 20 | 7 | 0 |
| 2022-Yices2n | 0 | 947 | 4649.59 | 4655.59 | 20 | 7 | 0 |
| Yices2 | 0 | 947 | 4704.08 | 4707.05 | 20 | 7 | 0 |
| cvc5 | 0 | 725 | 9622.76 | 9627.42 | 242 | 16 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.