The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FP logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 10052 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 | 154 | 30577.712 | 30524.353 | 12 | 0 |
2021-Bitwuzlan | 0 | 139 | 32921.258 | 32855.164 | 16 | 0 |
z3-4.8.17n | 0 | 27 | 846657.442 | 846685.163 | 697 | 0 |
cvc5 | 0 | 1 | 47194.844 | 47206.034 | 39 | 0 |
MathSATn | 0 | 0 | 167.023 | 176.122 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 154 | 30580.752 | 30524.033 | 12 | 0 |
2021-Bitwuzlan | 0 | 139 | 32923.098 | 32854.364 | 16 | 0 |
z3-4.8.17n | 0 | 27 | 846770.122 | 846651.083 | 697 | 0 |
cvc5 | 0 | 1 | 47201.574 | 47204.464 | 39 | 0 |
MathSATn | 0 | 0 | 167.023 | 176.122 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.