The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the ABVFP logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 1 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 | 0 | 0.03 | 0.028 | 0 | 0 |
cvc5 | 0 | 0 | 0.144 | 0.144 | 0 | 0 |
2021-cvc5-ucn | 0 | 0 | 0.873 | 0.873 | 0 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 4.431 | 2.804 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
z3-4.8.17n | 0 | 0 | 0.03 | 0.028 | 0 | 0 |
cvc5 | 0 | 0 | 0.144 | 0.144 | 0 | 0 |
2021-cvc5-ucn | 0 | 0 | 0.873 | 0.873 | 0 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 4.431 | 2.804 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.