The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLIA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 183 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 | 183 | 1392.832 | 803.097 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 182 | 4007.791 | 4005.873 | 1 | 0 | 0 |
veriT | 0 | 180 | 6517.743 | 6514.948 | 3 | 3 | 0 |
cvc5 | 0 | 94 | 106214.691 | 106176.676 | 89 | 88 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
smtinterpol | 0 | 183 | 1392.832 | 803.097 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 182 | 4007.791 | 4005.873 | 1 | 0 | 0 |
veriT | 0 | 180 | 6518.103 | 6514.778 | 3 | 3 | 0 |
cvc5 | 0 | 94 | 106227.441 | 106172.746 | 89 | 88 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.