The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABVFPLRA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 5 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 | 2372 | 165.092 | 165.172 | 0 | 0 |
| Bitwuzla Fixedn | 0 | 2372 | 168.183 | 168.187 | 0 | 0 |
| cvc5 | 0 | 1928 | 317.846 | 317.956 | 0 | 0 |
| 2022-z3-4.8.17n | 0 | 1259 | 584.491 | 584.761 | 1 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 2372 | 165.092 | 165.172 | 0 | 0 |
| Bitwuzla Fixedn | 0 | 2372 | 168.183 | 168.187 | 0 | 0 |
| cvc5 | 0 | 1928 | 317.846 | 317.956 | 0 | 0 |
| 2022-z3-4.8.17n | 0 | 1259 | 584.491 | 584.761 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.