The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the LIA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 150 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 | 149 | 64.605 | 64.448 | 1 | 1 | 0 |
cvc5 | 0 | 143 | 728.539 | 719.555 | 7 | 6 | 0 |
SMTInterpol | 0 | 101 | 224.768 | 122.854 | 49 | 10 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 149 | 64.605 | 64.448 | 1 | 1 | 0 |
cvc5 | 0 | 143 | 728.539 | 719.555 | 7 | 6 | 0 |
SMTInterpol | 0 | 101 | 224.768 | 122.854 | 49 | 10 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.