The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFNIA logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 12 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 | 20308 | 1.623 | 2.155 | 0 | 0 |
| MathSAT5n | 0 | 20117 | 9.052 | 10.146 | 0 | 0 |
| cvc5-uc | 0 | 20050 | 233.925 | 233.937 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3n | 0 | 20308 | 1.623 | 2.155 | 0 | 0 |
| MathSAT5n | 0 | 20117 | 9.052 | 10.146 | 0 | 0 |
| cvc5-uc | 0 | 20050 | 233.925 | 233.937 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.