The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the AUFNIRA logic in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 165 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 |
|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 3092 | 25141.928 | 25141.257 | 360 | 20 | 0 |
| 2020-z3n | 0 | 2829 | 45158.419 | 45159.795 | 623 | 31 | 0 |
| z3-4.8.17n | 0 | 2731 | 49103.906 | 49105.743 | 721 | 36 | 0 |
| smtinterpol | 0 | 0 | 274.92 | 120.821 | 3452 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 687.79 | 308.671 | 3452 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.