The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FPLRA logic in the Model Validation Track.
Page generated on 2022-08-10 11:19:11 +0000
Benchmarks: 51 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 | 51 | 1888.496 | 1883.636 | 0 | 0 |
cvc5 | 0 | 45 | 8314.467 | 8315.608 | 6 | 0 |
z3-4.8.17n | 0 | 42 | 14816.72 | 14819.931 | 7 | 2 |
MathSATn | 0 | 27 | 7673.186 | 7674.578 | 6 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 51 | 1888.496 | 1883.636 | 0 | 0 |
cvc5 | 0 | 45 | 8315.237 | 8315.398 | 6 | 0 |
z3-4.8.17n | 0 | 42 | 14818.61 | 14819.581 | 7 | 2 |
MathSATn | 0 | 27 | 7674.216 | 7674.398 | 6 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.