The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the BVFPLRA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 9 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 |
---|---|---|---|---|---|---|
2020-CVC4-ucn | 0 | 50 | 10.934 | 10.932 | 0 | 0 |
z3-4.8.17n | 0 | 49 | 329.156 | 329.204 | 0 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 42.93 | 25.678 | 0 | 0 |
cvc5 | 0 | 0 | 8426.459 | 8427.68 | 7 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2020-CVC4-ucn | 0 | 50 | 10.934 | 10.932 | 0 | 0 |
z3-4.8.17n | 0 | 49 | 329.156 | 329.204 | 0 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 42.93 | 25.678 | 0 | 0 |
cvc5 | 0 | 0 | 8427.279 | 8427.28 | 7 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.