The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AX logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 202 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Yices2 | Yices2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Yices2 | 0 | 38655 | 5.963 | 6.549 | 0 | 0 |
2022-z3-4.8.17n | 0 | 38218 | 23.217 | 22.87 | 0 | 0 |
cvc5 | 0 | 31756 | 134.609 | 133.555 | 0 | 0 |
SMTInterpol | 0 | 470 | 585.799 | 247.139 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Yices2 | 0 | 38655 | 5.963 | 6.549 | 0 | 0 |
2022-z3-4.8.17n | 0 | 38218 | 23.217 | 22.87 | 0 | 0 |
cvc5 | 0 | 31756 | 134.609 | 133.555 | 0 | 0 |
SMTInterpol | 0 | 470 | 585.799 | 247.139 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.