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 2022-08-10 11:19:33 +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 | 766.139 | 451.021 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 69 | 4931.379 | 4927.8 | 3 | 3 | 0 |
veriT | 0 | 16 | 5.692 | 5.167 | 56 | 0 | 0 |
cvc5 | 0 | 15 | 66750.365 | 66744.527 | 57 | 55 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
smtinterpol | 0 | 72 | 766.139 | 451.021 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 69 | 4931.939 | 4927.74 | 3 | 3 | 0 |
veriT | 0 | 16 | 5.692 | 5.167 | 56 | 0 | 0 |
cvc5 | 0 | 15 | 66757.875 | 66741.827 | 57 | 55 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.