The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABVFP logic in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 9214 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 | 273891 | 66880.039 | 66767.409 | 60 | 34 | 0 |
| 2021-Bitwuzla - fixedn | 0 | 273891 | 68594.305 | 68332.137 | 60 | 34 | 0 |
| MathSATn | 0 | 273400 | 171788.06 | 171171.537 | 551 | 49 | 0 |
| cvc5 | 0 | 241909 | 1937456.14 | 1936886.023 | 32042 | 1322 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.