The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFIDL logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 113 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 |
---|---|---|---|---|---|---|
2022-Yices2n | 0 | 675342 | 25970.995 | 25974.864 | 43 | 0 |
Yices2 | 0 | 631468 | 24813.559 | 24817.1 | 46 | 0 |
cvc5 | 0 | 62360 | 5285.561 | 5286.086 | 94 | 0 |
SMTInterpol | 0 | 48510 | 5940.06 | 3310.024 | 94 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2022-Yices2n | 0 | 675342 | 25970.995 | 25974.864 | 43 | 0 |
Yices2 | 0 | 631468 | 24813.559 | 24817.1 | 46 | 0 |
cvc5 | 0 | 62360 | 5285.561 | 5286.086 | 94 | 0 |
SMTInterpol | 0 | 54572 | 7627.94 | 4226.363 | 93 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.