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 Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 300 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
cvc5 | cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 25417 | 110.2 | 109.102 | 0 | 0 |
2022-Yices2n | 0 | 18077 | 17.167 | 18.521 | 0 | 0 |
Yices2 | 0 | 18077 | 17.584 | 18.745 | 0 | 0 |
SMTInterpol | 0 | 1316 | 684.529 | 309.053 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 25417 | 110.2 | 109.102 | 0 | 0 |
2022-Yices2n | 0 | 18077 | 17.167 | 18.521 | 0 | 0 |
Yices2 | 0 | 18077 | 17.584 | 18.745 | 0 | 0 |
SMTInterpol | 0 | 1316 | 684.529 | 309.053 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.