The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ALIA logic in the Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 101 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| SMTInterpol | SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 100 | 3327.001 | 2740.628 | 0 | 0 |
| cvc5 | 0 | 39 | 13224.524 | 13228.147 | 62 | 0 |
| Yices2 | 0 | 0 | 0.0 | 0.0 | 11 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 100 | 3327.001 | 2740.628 | 0 | 0 |
| cvc5 | 0 | 39 | 13224.524 | 13228.147 | 62 | 0 |
| Yices2 | 0 | 0 | 0.0 | 0.0 | 11 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.