The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Equality+NonLinearArith division in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 512 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:Parallel Performance |
---|
cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 66376 | 95.94 | 125.07 | 0 | 0 | 0 | 0 |
cvc5 | 0 | 66362 | 17975.92 | 18021.0 | 14 | 0 | 1 | 0 |
SMTInterpol | 0 | 63659 | 1636.57 | 679.73 | 2717 | 0 | 0 | 0 |
Yices2 | 0 | 23188 | 6938.61 | 6970.69 | 43188 | 0 | 11 | 0 |
Yices2 Fixedn | 2 | 19708 | 4964.81 | 4996.17 | 46668 | 0 | 8 | 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.