The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BVFPLRA logic in the Model Validation Track.
Page generated on 2022-08-10 11:19:11 +0000
Benchmarks: 116 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 | 113 | 457.517 | 457.97 | 0 | 0 |
z3-4.8.17n | 0 | 110 | 4961.079 | 4961.9 | 0 | 0 |
cvc5 | 0 | 105 | 1736.99 | 1721.494 | 1 | 0 |
MathSATn | 0 | 76 | 2658.68 | 2612.086 | 1 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 113 | 457.517 | 457.97 | 0 | 0 |
z3-4.8.17n | 0 | 110 | 4961.079 | 4961.9 | 0 | 0 |
cvc5 | 0 | 105 | 1737.25 | 1721.474 | 1 | 0 |
MathSATn | 0 | 76 | 2658.77 | 2612.046 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.