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 2023-07-06 16:05:43 +0000
Benchmarks: 12 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
SMTInterpol | SMTInterpol |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
SMTInterpol | 0 | 20363 | 58.787 | 20.83 | 0 | 0 |
2021-cvc5-ucn | 0 | 20152 | 263.538 | 234.026 | 0 | 0 |
cvc5 | 0 | 16338 | 51.947 | 51.945 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
SMTInterpol | 0 | 20363 | 58.787 | 20.83 | 0 | 0 |
2021-cvc5-ucn | 0 | 20152 | 263.538 | 234.026 | 0 | 0 |
cvc5 | 0 | 16338 | 51.947 | 51.945 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.