The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BVFP logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 300 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 |
|---|---|---|---|---|---|---|---|
| 2022-Bitwuzlan | 0 | 2070 | 4171.76 | 4194.9 | 8 | 7 | 0 |
| Bitwuzla | 0 | 2066 | 2557.23 | 2575.97 | 12 | 10 | 0 |
| cvc5 | 0 | 2064 | 4565.02 | 4586.67 | 14 | 12 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.