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 Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 7046 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 | 7045 | 427.85 | 441.456 | 0 | 0 |
| Bitwuzla | 0 | 7045 | 433.021 | 444.459 | 0 | 0 |
| cvc5 | 0 | 7045 | 1811.774 | 1779.785 | 1 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla Fixedn | 0 | 7045 | 427.85 | 441.456 | 0 | 0 |
| Bitwuzla | 0 | 7045 | 433.021 | 444.459 | 0 | 0 |
| cvc5 | 0 | 7045 | 1811.774 | 1779.785 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.