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 Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 1972 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| Bitwuzla | Bitwuzla |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla Fixedn | 0 | 16717 | 1470.188 | 1470.293 | 3 | 0 |
| Bitwuzla | 0 | 16717 | 1473.329 | 1469.665 | 3 | 0 |
| 2022-z3-4.8.17n | 0 | 16288 | 30224.033 | 30075.579 | 37 | 0 |
| cvc5 | 0 | 16254 | 23656.3 | 23592.135 | 25 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 16717 | 1473.329 | 1469.665 | 3 | 0 |
| Bitwuzla Fixedn | 0 | 16717 | 1470.188 | 1470.293 | 3 | 0 |
| 2022-z3-4.8.17n | 0 | 16288 | 30224.033 | 30075.579 | 37 | 0 |
| cvc5 | 0 | 16254 | 23656.3 | 23592.135 | 25 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.