The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the ALIA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 24 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2020-z3n | 0 | 202552 | 152.962 | 139.607 | 0 | 0 | 0 |
| z3n | 0 | 202552 | 178.037 | 164.378 | 0 | 0 | 0 |
| SMTInterpol | 0 | 202536 | 959.48 | 403.753 | 16 | 0 | 0 |
| cvc5-inc | 0 | 202423 | 585.285 | 541.354 | 129 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 187825 | 10831.381 | 9639.057 | 14727 | 3 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.