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 2023-07-06 16:05:24 +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 | 316417 | 36869.06 | 37934.47 | 59 | 0 | 35 | 0 |
2022-Bitwuzlan | 0 | 316373 | 27097.47 | 28131.8 | 103 | 0 | 33 | 0 |
cvc5 | 0 | 275830 | 1642851.62 | 1644196.59 | 40646 | 0 | 1626 | 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.