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 Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 386 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Yices2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
2020-z3n | 0 | 488728 | 81113.44 | 81126.62 | 6432 | 66 | 0 |
Yices2 Fixedn | 0 | 484975 | 70508.05 | 70511.44 | 10185 | 71 | 0 |
Yices2 | 0 | 484965 | 70820.78 | 70822.79 | 10195 | 71 | 0 |
SMTInterpol | 0 | 484796 | 107170.78 | 91615.93 | 10364 | 89 | 0 |
cvc5 | 0 | 395016 | 98760.0 | 98790.11 | 100144 | 82 | 0 |
OpenSMT | 0 | 21488 | 102314.78 | 102352.48 | 473672 | 88 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.