The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NIRA logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 2 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 |
|---|---|---|---|---|---|---|
| z3n | 0 | 27 | 55.488 | 55.491 | 0 | 0 |
| MathSAT5n | 0 | 26 | 21.484 | 21.491 | 0 | 0 |
| cvc5-uc | 0 | 24 | 947.18 | 947.437 | 0 | 0 |
| Yices2 | 0 | 0 | 0.007 | 0.024 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3n | 0 | 27 | 55.488 | 55.491 | 0 | 0 |
| MathSAT5n | 0 | 26 | 21.484 | 21.491 | 0 | 0 |
| cvc5-uc | 0 | 24 | 947.18 | 947.437 | 0 | 0 |
| Yices2 | 0 | 0 | 0.007 | 0.024 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.