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