The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LRA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 182 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 |
---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 152 | 18298.093 | 15518.968 | 30 | 31 | 0 |
cvc5-lfsc | 0 | 145 | 15809.257 | 15804.288 | 37 | 37 | 0 |
cvc5 | 0 | 54 | 718.036 | 711.923 | 128 | 122 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 152 | 18299.933 | 15469.888 | 30 | 30 | 0 |
cvc5-lfsc | 0 | 145 | 15809.257 | 15804.288 | 37 | 37 | 0 |
cvc5 | 0 | 54 | 718.036 | 711.923 | 128 | 122 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.