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 2021-07-18 17:31:25 +0000
Benchmarks: 8 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| cvc5-uc | cvc5-uc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| cvc5-uc | 0 | 58950 | 1161.3 | 1161.718 | 0 | 0 |
| MathSAT5n | 0 | 44055 | 6534.221 | 6535.618 | 5 | 0 |
| z3n | 0 | 5578 | 1884.329 | 2405.96 | 2 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| cvc5-uc | 0 | 58950 | 1161.3 | 1161.718 | 0 | 0 |
| MathSAT5n | 0 | 44055 | 6535.171 | 6535.318 | 5 | 0 |
| z3n | 0 | 5578 | 2405.859 | 2405.86 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.