The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Equality division in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 889 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 14063 | 614.26 | 682.74 | 0 | 0 | 0 | 0 |
| SMTInterpol | 0 | 14063 | 3735.65 | 1564.13 | 0 | 0 | 0 | 0 |
| Yices2 Fixedn | 0 | 762 | 23.86 | 77.13 | 13301 | 0 | 0 | 0 |
| Yices2 | 0 | 762 | 24.22 | 77.43 | 13301 | 0 | 0 | 0 |
| 2022-Yices2n | 0 | 762 | 31.18 | 82.75 | 13301 | 0 | 0 | 0 |
| OpenSMT | 0 | 762 | 787.49 | 833.63 | 13301 | 0 | 0 | 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.