The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BVFP logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 1591 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 | 282 | 1561172.914 | 1561369.617 | 1309 | 1264 | 36 |
cvc5 | 0 | 262 | 1579944.241 | 1580142.413 | 1329 | 1276 | 36 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 282 | 1561330.854 | 1561330.807 | 1309 | 1264 | 36 |
cvc5 | 0 | 262 | 1580172.511 | 1580079.313 | 1329 | 1276 | 36 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.