The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ALIA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 72 Time Limit: 1200 seconds Memory Limit: 60 GB
This track is experimental. Solvers are only ranked by performance, but no winner is selected.
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 72 | 1929.836 | 1291.671 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 71 | 3228.435 | 3228.508 | 1 | 1 | 0 |
cvc5 | 0 | 16 | 482.779 | 478.708 | 56 | 55 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 72 | 1929.836 | 1291.671 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 71 | 3228.435 | 3228.508 | 1 | 1 | 0 |
cvc5 | 0 | 16 | 482.779 | 478.708 | 56 | 55 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.