The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_IDL logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 100 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 | 490495 | 10753.265 | 10754.979 | 79 | 0 |
2022-MathSATn | 0 | 419674 | 2885.08 | 2882.637 | 89 | 0 |
SMTInterpol | 0 | 325795 | 3930.238 | 2108.506 | 86 | 0 |
Yices2 | 0 | 75443 | 5567.548 | 5568.51 | 88 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 490495 | 10753.265 | 10754.979 | 79 | 0 |
2022-MathSATn | 0 | 419674 | 2885.08 | 2882.637 | 89 | 0 |
SMTInterpol | 0 | 340411 | 6884.138 | 3769.866 | 84 | 0 |
Yices2 | 0 | 75443 | 5567.548 | 5568.51 | 88 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.