The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLRA division in the Incremental Track.
Page generated on 2020-07-04 11:47:56 +0000
Benchmarks: 1223 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Yices2 incremental |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
z3n | 0 | 9793 | 8634.843 | 8344.725 | 0 | 0 | 0 | |
2019-Z3n | 0 | 9793 | 8972.914 | 8891.387 | 0 | 0 | 0 | |
MathSAT5n | 0 | 9791 | 8750.576 | 8476.956 | 2 | 1 | 0 | |
Yices2 incremental | 0 | 9780 | 11944.717 | 11753.99 | 13 | 4 | 0 | |
Yices2-fixed incrementaln | 0 | 9780 | 11995.881 | 11804.362 | 13 | 4 | 0 | |
SMTInterpol | 0 | 9777 | 34926.137 | 28766.239 | 16 | 8 | 0 | |
SMTInterpol-fixedn | 0 | 9777 | 35175.429 | 29015.765 | 16 | 8 | 0 | |
CVC4-inc | 0 | 9776 | 37957.084 | 37574.441 | 17 | 9 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.