The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABVFP division in the Incremental Track.
Page generated on 2020-07-04 11:47:56 +0000
Benchmarks: 62 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Bitwuzla |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| Bitwuzla-fixedn | 0 | 222 | 59120.359 | 59120.466 | 47 | 47 | 0 | |
| Bitwuzla | 0 | 221 | 60221.933 | 60222.065 | 48 | 48 | 0 | |
| MathSAT5n | 0 | 219 | 60056.321 | 60056.061 | 50 | 50 | 0 | |
| CVC4-inc | 0 | 218 | 61310.553 | 61310.251 | 51 | 51 | 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.