The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFBV logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 342 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 | 150 | 278753.728 | 278659.97 | 192 | 192 | 0 |
cvc5 | 0 | 3 | 402740.681 | 402796.609 | 339 | 334 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 150 | 278822.668 | 278652.34 | 192 | 192 | 0 |
cvc5 | 0 | 3 | 402807.181 | 402779.599 | 339 | 334 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.