The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BVFP division in the Incremental Track.
Page generated on 2021-07-14 14:12:24 +0000
Benchmarks: 118 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Bitwuzla |
Note: the division has disagreements
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| Bitwuzla-fixedn | 0 | 154 | 21756.179 | 21757.033 | 14 | 14 | 0 | |
| Bitwuzla | 0 | 152 | 22354.495 | 22316.16 | 16 | 16 | 0 | |
| MathSAT5n | 0 | 148 | 30176.284 | 30176.155 | 20 | 20 | 0 | |
| CVC4-inc | 0 | 144 | 33029.288 | 33018.299 | 24 | 22 | 0 | |
| z3n | 0 | 118 | 61336.8 | 61338.104 | 50 | 44 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.