The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NIA logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 2051 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 | 27288 | 91600.617 | 91439.703 | 29 | 0 |
| MathSAT5n | 0 | 25386 | 195226.129 | 195085.608 | 118 | 1 |
| cvc5-uc | 0 | 25264 | 599647.519 | 599499.171 | 388 | 0 |
| Yices2 | 0 | 0 | 6.978 | 25.478 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3n | 0 | 27288 | 91604.027 | 91438.733 | 29 | 0 |
| MathSAT5n | 0 | 25386 | 195251.699 | 195080.448 | 118 | 1 |
| cvc5-uc | 0 | 25264 | 599719.809 | 599482.531 | 388 | 0 |
| Yices2 | 0 | 0 | 6.978 | 25.478 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.