The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFNRA logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 11 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 | 66 | 0.443 | 0.443 | 0 | 0 |
| MathSAT5n | 0 | 66 | 0.445 | 0.446 | 0 | 0 |
| cvc5-uc | 0 | 58 | 24.888 | 24.898 | 0 | 0 |
| Yices2 | 0 | 0 | 0.038 | 0.141 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3n | 0 | 66 | 0.443 | 0.443 | 0 | 0 |
| MathSAT5n | 0 | 66 | 0.445 | 0.446 | 0 | 0 |
| cvc5-uc | 0 | 58 | 24.888 | 24.898 | 0 | 0 |
| Yices2 | 0 | 0 | 0.038 | 0.141 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.