The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LIA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 1208 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 | 1156 | 105306.505 | 78270.584 | 52 | 54 | 0 |
cvc5-lfsc | 0 | 695 | 29687.535 | 29668.296 | 513 | 509 | 0 |
cvc5 | 0 | 498 | 1263.415 | 1253.449 | 710 | 704 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 1156 | 105341.815 | 77749.765 | 52 | 52 | 0 |
cvc5-lfsc | 0 | 695 | 29687.535 | 29668.296 | 513 | 509 | 0 |
cvc5 | 0 | 498 | 1263.415 | 1253.449 | 710 | 704 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.