The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UF logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 1090 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 | 1051 | 61439.469 | 61314.711 | 39 | 39 | 0 |
SMTInterpol | 0 | 1045 | 30587.075 | 18799.47 | 45 | 48 | 0 |
cvc5 | 0 | 60 | 382.129 | 378.199 | 1030 | 1005 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 1051 | 61439.469 | 61314.711 | 39 | 39 | 0 |
SMTInterpol | 0 | 1045 | 31121.815 | 17940.122 | 45 | 45 | 0 |
cvc5 | 0 | 60 | 382.129 | 378.199 | 1030 | 1005 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.