The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFLIA logic in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 72 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 | 4657540 | 4754.429 | 4579.416 | 42324 | 1 | 0 |
| z3-4.8.17n | 0 | 4519784 | 6672.737 | 6505.442 | 180080 | 1 | 0 |
| smtinterpol | 0 | 3714150 | 17952.281 | 16337.77 | 985714 | 3 | 0 |
| cvc5 | 0 | 3611395 | 26515.757 | 26345.532 | 1088469 | 11 | 0 |
| Yices2 | 0 | 3050626 | 2396.543 | 2234.045 | 1649238 | 0 | 0 |
| MathSATn | 0 | 2046477 | 5801.945 | 5669.377 | 2653387 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.