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 2022-08-10 11:18:21 +0000
Benchmarks: 24 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 202552 | 177.646 | 163.689 | 0 | 0 | 0 |
| 2021-z3n | 0 | 202552 | 178.255 | 164.315 | 0 | 0 | 0 |
| cvc5 | 0 | 202550 | 722.769 | 701.208 | 2 | 0 | 0 |
| smtinterpol | 0 | 202523 | 987.157 | 436.74 | 29 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 198581 | 8021.708 | 6858.165 | 3971 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.