The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLRA logic in the Model Validation Track.
Page generated on 2021-07-18 17:31:50 +0000
Benchmarks: 385 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Yices2 model-validation | Yices2 model-validation |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Yices2 model-validation | 0 | 383 | 2456.783 | 2453.958 | 2 | 0 |
cvc5-mv | 0 | 383 | 3188.523 | 3189.2 | 2 | 0 |
SMTInterpol | 0 | 383 | 5430.784 | 3727.689 | 2 | 0 |
z3-mvn | 0 | 238 | 23751.27 | 23552.793 | 14 | 0 |
MathSAT5n | 0 | 147 | 2614.819 | 2613.754 | 2 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Yices2 model-validation | 0 | 383 | 2456.983 | 2453.818 | 2 | 0 |
cvc5-mv | 0 | 383 | 3189.033 | 3189.15 | 2 | 0 |
SMTInterpol | 0 | 383 | 5430.784 | 3727.689 | 2 | 0 |
z3-mvn | 0 | 238 | 23752.7 | 23552.373 | 14 | 0 |
MathSAT5n | 0 | 147 | 2615.159 | 2613.614 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.