The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the NIA division as of Thu Jul 7 07:24:34 GMT
Benchmarks in this division: 9
Time Limit: 1200s
| Sequential Performance | Parallel Performance |
|---|---|
| ProB | ProB |
| Solver | Error Score | Correct Score | avg. CPU time |
|---|---|---|---|
| CVC4 | 0.000 | 5.000 | 0.019 |
| ProB | 0.000 | 8.000 | 0.888 |
| vampire_smt_4.1 | 0.000 | 6.000 | 335.043 |
| vampire_smt_4.1_parallel | 0.000 | 7.000 | 537.677 |
| z3n | 0.000 | 9.000 | 0.038 |
| Solver | Error Score | Correct Score | avg. CPU time | avg. WALL time | Unsolved |
|---|---|---|---|---|---|
| CVC4 | 0.000 | 5.000 | 0.019 | 0.020 | 4 |
| ProB | 0.000 | 8.000 | 0.888 | 0.887 | 1 |
| vampire_smt_4.1 | 0.000 | 6.000 | 335.043 | 333.271 | 3 |
| vampire_smt_4.1_parallel | 0.000 | 7.000 | 871.029 | 232.010 | 2 |
| z3n | 0.000 | 9.000 | 0.038 | 0.037 | 0 |
n. Non-competitive.
1. Scores are computed according to Section 7 of the rules.