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 2022-08-10 11:18:51 +0000
Benchmarks: 11 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| cvc5 | cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 66 | 0.456 | 0.435 | 0 | 0 |
| MathSATn | 0 | 64 | 2.409 | 2.417 | 0 | 0 |
| 2021-cvc5-ucn | 0 | 60 | 15.988 | 16.003 | 0 | 0 |
| cvc5 | 0 | 56 | 8.295 | 8.29 | 0 | 0 |
| smtinterpol | 0 | 23 | 7.078 | 4.67 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 66 | 0.456 | 0.435 | 0 | 0 |
| MathSATn | 0 | 64 | 2.409 | 2.417 | 0 | 0 |
| 2021-cvc5-ucn | 0 | 60 | 15.988 | 16.003 | 0 | 0 |
| cvc5 | 0 | 56 | 8.295 | 8.29 | 0 | 0 |
| smtinterpol | 0 | 23 | 7.078 | 4.67 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.