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 2021-07-18 17:30:28 +0000
Benchmarks: 9212 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| cvc5-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| Bitwuzla - fixedn | 0 | 270641 | 54018.992 | 53934.107 | 93 | 25 | 0 |
| 2020-Bitwuzla-fixedn | 0 | 270641 | 54186.265 | 53995.999 | 93 | 25 | 0 |
| cvc5-inc | 0 | 236975 | 1915929.834 | 1915399.345 | 33759 | 1297 | 0 |
| 2020-CVC4-incn | 0 | 229596 | 2131396.052 | 2130888.331 | 41138 | 1524 | 0 |
| MathSAT5n | 16 | 269696 | 154134.21 | 153331.739 | 1038 | 42 | 0 |
| Bitwuzla | 47 | 269011 | 54063.605 | 53809.349 | 1723 | 25 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.