The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFLIA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 380 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 | 380 | 1005.865 | 409.385 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 363 | 28232.302 | 28229.345 | 17 | 17 | 0 |
cvc5 | 0 | 219 | 191018.194 | 190976.898 | 161 | 157 | 0 |
veriT | 0 | 131 | 16.876 | 14.616 | 249 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
smtinterpol | 0 | 380 | 1005.865 | 409.385 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 363 | 28233.772 | 28228.815 | 17 | 17 | 0 |
cvc5 | 0 | 219 | 191037.564 | 190970.028 | 161 | 157 | 0 |
veriT | 0 | 131 | 16.876 | 14.616 | 249 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.