The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Equality+LinearArith division in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 2031 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| smtinterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2020-z3n | 0 | 5684322 | 104533.434 | 103917.434 | 48649 | 0 | 68 | 0 |
| z3-4.8.17n | 0 | 5546960 | 106176.277 | 105551.876 | 186011 | 0 | 68 | 0 |
| smtinterpol | 0 | 4736653 | 215977.283 | 198670.067 | 996318 | 0 | 127 | 0 |
| cvc5 | 0 | 4519529 | 212794.778 | 211949.047 | 1213442 | 0 | 121 | 0 |
| Yices2 | 0 | 4073653 | 112142.344 | 111568.94 | 1659318 | 0 | 78 | 0 |
| MathSATn | 0 | 3041157 | 139442.691 | 138811.76 | 2691814 | 0 | 100 | 0 |
| OpenSMT | 0 | 30242 | 206119.521 | 205790.863 | 472467 | 0 | 141 | 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.