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 2020-07-04 11:47:56 +0000
Benchmarks: 119 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 | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| Bitwuzla-fixedn | 0 | 157 | 21756.293 | 21757.147 | 14 | 14 | 0 |
| Bitwuzla | 0 | 155 | 22354.569 | 22316.234 | 16 | 16 | 0 |
| MathSAT5n | 0 | 151 | 30177.129 | 30177.0 | 20 | 20 | 0 |
| CVC4-inc | 0 | 147 | 33029.983 | 33018.993 | 24 | 22 | 0 |
| z3n | 0 | 121 | 61353.255 | 61354.56 | 50 | 44 | 0 |
n Non-competing.