The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBV division as of Fri Jul 21 10:18:02 GMT
Benchmarks in this division: 31
Time Limit: 1200s
| Sequential Performance | Parallel Performance |
|---|---|
| Yices2 | Yices2 |
| Solver | Error Score | Correct Score | CPU Time | Unsolved |
|---|---|---|---|---|
| Boolector | 0.000 | 31.000 | 0.530 | 0 |
| CVC4 | 0.000 | 31.000 | 0.287 | 0 |
| Yices2 | 0.000 | 31.000 | 0.281 | 0 |
| mathsat-5.4.1n | 0.000 | 31.000 | 0.093 | 0 |
| z3-4.5.0n | 0.000 | 31.000 | 1.333 | 0 |
| Solver | Error Score | Correct Score | CPU Score | WALL Score | Unsolved |
|---|---|---|---|---|---|
| Boolector | 0.000 | 31.000 | 0.530 | 0.532 | 0 |
| CVC4 | 0.000 | 31.000 | 0.287 | 0.288 | 0 |
| Yices2 | 0.000 | 31.000 | 0.281 | 0.282 | 0 |
| mathsat-5.4.1n | 0.000 | 31.000 | 0.093 | 0.094 | 0 |
| z3-4.5.0n | 0.000 | 31.000 | 1.333 | 1.335 | 0 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.