The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABV logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 2343 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 | 2127 | 305283.78 | 305299.701 | 216 | 211 | 5 |
cvc5 | 0 | 1609 | 849613.778 | 849474.062 | 734 | 685 | 5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 2127 | 305329.72 | 305291.471 | 216 | 211 | 5 |
cvc5 | 0 | 1609 | 849728.178 | 849439.972 | 734 | 685 | 5 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.