The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLRA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 101 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 |
---|---|---|---|---|---|---|
cvc5 | 0 | 65 | 1011.177 | 1011.409 | 0 | 0 |
2022-Yices2n | 0 | 58 | 20.882 | 21.227 | 0 | 0 |
Yices2 | 0 | 58 | 21.017 | 21.318 | 0 | 0 |
SMTInterpol | 0 | 57 | 1670.462 | 987.754 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 65 | 1011.177 | 1011.409 | 0 | 0 |
2022-Yices2n | 0 | 58 | 20.882 | 21.227 | 0 | 0 |
Yices2 | 0 | 58 | 21.017 | 21.318 | 0 | 0 |
SMTInterpol | 0 | 57 | 1670.462 | 987.754 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.