The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBV logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 40 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 | 28 | 14875.614 | 14851.791 | 12 | 12 | 0 |
cvc5 | 0 | 2 | 45590.061 | 45601.629 | 38 | 38 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 28 | 14880.384 | 14851.311 | 12 | 12 | 0 |
cvc5 | 0 | 2 | 45600.131 | 45600.129 | 38 | 38 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.