The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BVFPLRA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 52 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 | 0 | 325 | 1764.647 | 1757.758 | 9 | 0 |
| Bitwuzla Fixedn | 0 | 325 | 1785.771 | 1786.128 | 9 | 0 |
| 2022-z3-4.8.17n | 0 | 238 | 3173.996 | 3174.952 | 20 | 0 |
| cvc5 | 0 | 169 | 6481.227 | 6482.014 | 7 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 325 | 1764.647 | 1757.758 | 9 | 0 |
| Bitwuzla Fixedn | 0 | 325 | 1785.771 | 1786.128 | 9 | 0 |
| 2022-z3-4.8.17n | 0 | 238 | 3173.996 | 3174.952 | 20 | 0 |
| cvc5 | 0 | 169 | 6481.227 | 6482.014 | 7 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.