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 2023-07-06 16:05:24 +0000
Benchmarks: 44 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2020-z3n | 0 | 530398 | 807.67 | 716.45 | 0 | 0 | 0 |
| cvc5 | 0 | 530398 | 2521.46 | 2402.72 | 0 | 0 | 0 |
| SMTInterpol | 0 | 530398 | 4330.8 | 3108.47 | 0 | 0 | 0 |
| Yices2 | 0 | 530352 | 467.82 | 381.53 | 46 | 2 | 0 |
| Yices2 Fixedn | 0 | 530352 | 472.07 | 384.65 | 46 | 2 | 0 |
| OpenSMT | 0 | 64920 | 52660.93 | 52664.87 | 465478 | 44 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.