The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ANIA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 5 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 |
---|---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 51724 | 56.03 | 52.39 | 0 | 0 | 0 |
SMTInterpol | 0 | 51724 | 264.6 | 95.52 | 0 | 0 | 0 |
cvc5 | 0 | 51724 | 252.11 | 247.52 | 0 | 0 | 0 |
Yices2 | 0 | 8710 | 5295.41 | 5295.65 | 43014 | 5 | 0 |
Yices2 Fixedn | 2 | 5230 | 3342.19 | 3342.47 | 46494 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.