The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ANIA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 29 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 |
|---|---|---|---|---|---|---|
| 2021-cvc5-ucn | 0 | 58962 | 1571.003 | 1571.4 | 16 | 0 |
| SMTInterpol | 0 | 48813 | 948.925 | 717.46 | 10 | 0 |
| cvc5 | 0 | 15253 | 1549.03 | 1550.136 | 16 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2021-cvc5-ucn | 0 | 58962 | 1571.003 | 1571.4 | 16 | 0 |
| SMTInterpol | 0 | 48813 | 948.925 | 717.46 | 10 | 0 |
| cvc5 | 0 | 15253 | 1549.03 | 1550.136 | 16 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.