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 2022-08-10 11:18:51 +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 |
|---|---|---|---|---|---|---|
| Yices2 | 0 | 0 | 358.973 | 359.043 | 0 | 0 |
| z3-4.8.17n | 0 | 0 | 742.622 | 740.672 | 0 | 0 |
| 2021-cvc5-ucn | 0 | 0 | 1209.796 | 1209.975 | 1 | 0 |
| MathSATn | 0 | 0 | 1285.141 | 1285.148 | 0 | 1 |
| smtinterpol | 0 | 0 | 2691.436 | 2555.451 | 2 | 0 |
| cvc5 | 0 | 0 | 2763.737 | 2760.698 | 2 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Yices2 | 0 | 0 | 358.973 | 359.043 | 0 | 0 |
| z3-4.8.17n | 0 | 0 | 742.622 | 740.672 | 0 | 0 |
| 2021-cvc5-ucn | 0 | 0 | 1209.866 | 1209.865 | 1 | 0 |
| MathSATn | 0 | 0 | 1285.141 | 1285.148 | 0 | 1 |
| smtinterpol | 0 | 0 | 2691.436 | 2555.451 | 2 | 0 |
| cvc5 | 0 | 0 | 2764.087 | 2760.638 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.