| Name | Crossword/ Crossword-m18-ogd2008-vg-15-16_c18.xml |
| MD5SUM | 57cb1bb20db45191d6ed694399d37744 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 240 |
| Number of constraints | 31 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":240}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":240}] |
| Minimum constraint arity | 15 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":15,"count":16},{"arity":16,"count":15}] |
| Number of extensional constraints | 31 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":31}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4299810 | ? (TO) | 2519.76 | 2520.01 |
| minimacht 2018.07.27 (complete) | 4300819 | ? (TO) | 2519.9 | 2520.01 |
| miniBTD_12 2018.07.27_12 (complete) | 4300995 | ? (TO) | 2519.96 | 2520.01 |
| cosoco 1.12 (complete) | 4299807 | ? (TO) | 2519.96 | 2520.01 |
| miniBTD 2018.07.27_3 (complete) | 4301171 | ? (TO) | 2520.03 | 2520.01 |
| slowpoke 2018-04-29 (incomplete) | 4299811 | ? (TO) | 2520.04 | 2515.41 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299813 | ? (TO) | 2520.05 | 2513.51 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299812 | ? (TO) | 2520.06 | 2476.03 |
| GG's minicp 2018-04-29 (complete) | 4299808 | ? (TO) | 2520.06 | 2502.02 |
| The dodo solver 2018-04-29 (complete) | 4299814 | ? (TO) | 2520.1 | 2507.91 |
| MiniCPFever 2018-04-29 (complete) | 4299809 | ? (TO) | 2520.11 | 2464.81 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: