The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLIA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 26 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Yices2 | Yices2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Yices2 | 0 | 398048 | 514.975 | 515.264 | 2 | 0 |
2022-Yices2n | 0 | 398048 | 519.361 | 519.614 | 2 | 0 |
cvc5 | 0 | 364807 | 2919.708 | 2920.333 | 3 | 0 |
SMTInterpol | 0 | 250228 | 3317.462 | 2936.301 | 2 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Yices2 | 0 | 398048 | 514.975 | 515.264 | 2 | 0 |
2022-Yices2n | 0 | 398048 | 519.361 | 519.614 | 2 | 0 |
cvc5 | 0 | 364807 | 2919.708 | 2920.333 | 3 | 0 |
SMTInterpol | 0 | 250228 | 3317.462 | 2936.301 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.