The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ALIA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 44 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| cvc5-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2020-z3n | 0 | 530398 | 823.669 | 712.547 | 0 | 0 | 0 |
| z3n | 0 | 530398 | 893.309 | 797.595 | 0 | 0 | 0 |
| 2018-Z3 (incremental)n | 0 | 530398 | 977.953 | 881.925 | 0 | 0 | 0 |
| cvc5-inc | 0 | 530398 | 2545.072 | 2413.156 | 0 | 0 | 0 |
| SMTInterpol | 0 | 530398 | 3808.469 | 2595.615 | 0 | 0 | 0 |
| Yices2 incremental | 0 | 530352 | 2797.203 | 2720.658 | 46 | 2 | 0 |
| MathSAT5n | 0 | 500560 | 1009.75 | 896.402 | 29838 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.