The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABVFP logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 1973 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 | 327 | 1941361.653 | 1941704.45 | 1646 | 1573 | 41 |
cvc5 | 0 | 295 | 1993958.698 | 1994185.791 | 1678 | 1616 | 41 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 327 | 1941534.603 | 1941660.0 | 1646 | 1573 | 41 |
cvc5 | 0 | 295 | 1994232.958 | 1994106.121 | 1678 | 1616 | 41 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.