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 Model Validation Track.
Page generated on 2022-08-10 11:19:11 +0000
Benchmarks: 10106 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 | 10103 | 8359.22 | 8439.559 | 3 | 0 |
cvc5 | 0 | 10101 | 12006.629 | 12014.413 | 5 | 0 |
z3-4.8.17n | 0 | 10076 | 32878.327 | 39293.813 | 17 | 0 |
MathSATn | 0 | 8673 | 21182.505 | 21172.525 | 14 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 10103 | 8361.0 | 8439.369 | 3 | 0 |
cvc5 | 0 | 10101 | 12008.329 | 12014.083 | 5 | 0 |
z3-4.8.17n | 0 | 10076 | 33478.957 | 39292.983 | 17 | 0 |
MathSATn | 0 | 8673 | 21184.545 | 21171.745 | 14 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.