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 2021-07-18 17:30:28 +0000
Benchmarks: 9653 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| cvc5-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| Bitwuzla - fixedn | 0 | 273264 | 64610.387 | 64525.865 | 105 | 0 | 32 | 0 |
| 2020-Bitwuzla-fixedn | 0 | 273264 | 65173.513 | 64983.682 | 105 | 0 | 32 | 0 |
| cvc5-inc | 0 | 239596 | 1928913.403 | 1928379.006 | 33773 | 0 | 1305 | 0 |
| 2020-CVC4-incn | 0 | 232212 | 2147701.951 | 2147193.595 | 41157 | 0 | 1535 | 0 |
| z3n | 0 | 2510 | 61825.417 | 61815.047 | 123 | 0 | 41 | 0 |
| MathSAT5n | 17 | 272313 | 169018.643 | 168210.675 | 1056 | 0 | 52 | 0 |
| Bitwuzla | 47 | 271634 | 64632.534 | 64378.573 | 1735 | 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.