The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ALIA logic in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 44 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 | 530398 | 819.075 | 716.188 | 0 | 0 | 0 |
| z3-4.8.17n | 0 | 530398 | 896.628 | 799.234 | 0 | 0 | 0 |
| smtinterpol | 0 | 530398 | 4437.18 | 3224.772 | 0 | 0 | 0 |
| Yices2 | 0 | 530382 | 1611.822 | 1532.358 | 16 | 1 | 0 |
| cvc5 | 0 | 527127 | 4818.687 | 4634.693 | 3271 | 1 | 0 |
| MathSATn | 0 | 500560 | 1084.257 | 969.824 | 29838 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.