The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the BVFP logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 10 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| — | — |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 1 | 1259.599 | 1260.013 | 1 | 0 |
| cvc5 | 0 | 0 | 3.577 | 3.575 | 0 | 0 |
| 2020-CVC4-ucn | 0 | 0 | 3.906 | 3.904 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 51.058 | 29.425 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 1 | 1259.959 | 1259.953 | 1 | 0 |
| cvc5 | 0 | 0 | 3.577 | 3.575 | 0 | 0 |
| 2020-CVC4-ucn | 0 | 0 | 3.906 | 3.904 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 51.058 | 29.425 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.