The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LIRA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 5 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| — | — |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2022-MathSATn | 0 | 0 | 51.779 | 51.785 | 0 | 1 |
| cvc5 | 0 | 0 | 89.377 | 89.398 | 2 | 0 |
| SMTInterpol | 0 | 0 | 168.948 | 96.699 | 2 | 0 |
| Yices2 | 0 | 0 | 748.048 | 748.201 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2022-MathSATn | 0 | 0 | 51.779 | 51.785 | 0 | 1 |
| cvc5 | 0 | 0 | 89.377 | 89.398 | 2 | 0 |
| SMTInterpol | 0 | 0 | 168.948 | 96.699 | 2 | 0 |
| Yices2 | 0 | 0 | 748.048 | 748.201 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.