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 2023-07-06 16:05:43 +0000
Benchmarks: 25 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 |
---|---|---|---|---|---|---|
2021-cvc5-ucn | 0 | 360 | 41.756 | 41.756 | 0 | 0 |
cvc5 | 0 | 354 | 33.98 | 32.932 | 0 | 0 |
SMTInterpol | 0 | 23 | 5.153 | 3.415 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2021-cvc5-ucn | 0 | 360 | 41.756 | 41.756 | 0 | 0 |
cvc5 | 0 | 354 | 33.98 | 32.932 | 0 | 0 |
SMTInterpol | 0 | 23 | 5.153 | 3.415 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.