The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LinearIntArith division in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 69 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2021-Yices2 incrementaln | 0 | 20040342 | 31047.31 | 30531.11 | 872 | 0 | 20 | 0 |
| Yices2 Fixedn | 0 | 20040341 | 30722.17 | 30201.32 | 873 | 0 | 20 | 0 |
| Yices2 | 0 | 20040337 | 30932.61 | 30397.49 | 877 | 0 | 20 | 0 |
| SMTInterpol | 0 | 16879520 | 67434.7 | 51865.91 | 3161694 | 0 | 39 | 0 |
| cvc5 | 0 | 3894925 | 63389.31 | 63201.49 | 16146289 | 0 | 50 | 0 |
| OpenSMT | 0 | 860294 | 54665.86 | 54631.4 | 19180920 | 0 | 42 | 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.