The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BV logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 13848 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 |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 6516 | 9227575.117 | 9228353.093 | 7332 | 7271 | 52 |
cvc5 | 0 | 4140 | 11348618.222 | 11347583.394 | 9708 | 9177 | 54 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 6516 | 9228659.117 | 9228125.263 | 7332 | 7270 | 52 |
cvc5 | 0 | 4140 | 11350385.442 | 11347119.994 | 9708 | 9177 | 54 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.