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 Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 279 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 | 279 | 1250.852 | 594.541 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 266 | 30539.119 | 30526.958 | 13 | 13 | 0 |
cvc5 | 0 | 69 | 235664.353 | 235566.108 | 210 | 188 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
smtinterpol | 0 | 279 | 1250.852 | 594.541 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 266 | 30539.619 | 30526.828 | 13 | 13 | 0 |
cvc5 | 0 | 69 | 235687.803 | 235557.108 | 210 | 188 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.