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 2023-07-06 16:05:24 +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 | 4660516 | 4790.13 | 4573.93 | 39348 | 1 | 0 |
| SMTInterpol | 0 | 3859751 | 16694.06 | 14762.69 | 840113 | 3 | 0 |
| cvc5 | 0 | 3677633 | 20092.0 | 19873.22 | 1022231 | 9 | 0 |
| Yices2 Fixedn | 0 | 3050626 | 2539.51 | 2376.53 | 1649238 | 0 | 0 |
| Yices2 | 0 | 3050626 | 2560.69 | 2400.08 | 1649238 | 0 | 0 |
| OpenSMT | 0 | 264166 | 6447.93 | 6429.2 | 4435698 | 5 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.