The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FPArith division in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 9752 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:Parallel Performance |
---|
Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
Bitwuzla | 0 | 311217 | 79622.343 | 79490.034 | 70 | 0 | 40 | 0 |
MathSATn | 0 | 310717 | 191152.933 | 190523.987 | 570 | 0 | 63 | 0 |
cvc5 | 0 | 279229 | 1954774.116 | 1954200.987 | 32058 | 0 | 1333 | 0 |
2021-Bitwuzla - fixedn | 0 | 276556 | 80224.927 | 79963.415 | 71 | 0 | 41 | 0 |
z3-4.8.17n | 0 | 2670 | 54236.302 | 54238.161 | 52 | 0 | 32 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.