The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NIA logic in the Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 7607 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Z3++ | Z3++ |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Z3++ | 0 | 7450 | 256987.989 | 256551.118 | 138 | 0 |
ismt | 0 | 7316 | 297844.868 | 296688.184 | 165 | 0 |
Yices2 | 0 | 5724 | 98630.792 | 98278.566 | 1883 | 0 |
cvc5 | 0 | 4841 | 310043.635 | 309461.587 | 2766 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Z3++ | 0 | 7450 | 256987.989 | 256551.118 | 138 | 0 |
ismt | 0 | 7316 | 297844.868 | 296688.184 | 281 | 0 |
Yices2 | 0 | 5724 | 98630.792 | 98278.566 | 1883 | 0 |
cvc5 | 0 | 4841 | 310043.635 | 309461.587 | 2766 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.