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 2023-07-06 16:05:24 +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 | 2996 | 1876.47 | 2095.44 | 0 | 0 | 0 |
| Yices2 | 0 | 2994 | 548.72 | 703.37 | 2 | 2 | 0 |
| Yices2 Fixedn | 0 | 2994 | 555.91 | 710.88 | 2 | 2 | 0 |
| 2022-Yices2n | 0 | 2994 | 556.63 | 713.67 | 2 | 2 | 0 |
| cvc5 | 0 | 2809 | 11111.22 | 11175.71 | 187 | 7 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.