| Name | Crossword/ Crossword-m18-ogd2008-vg-06-07_c18.xml |
| MD5SUM | eed26ff9eb0f4f7c4bd196d19099a77a |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.270002 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 42 |
| Number of constraints | 13 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":42}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":42}] |
| Minimum constraint arity | 6 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":6,"count":7},{"arity":7,"count":6}] |
| Number of extensional constraints | 13 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":13}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD_12 2018.07.27_12 (complete) | 4300986 | SAT | 0.270002 | 0.270666 |
| miniBTD 2018.07.27_3 (complete) | 4301162 | SAT | 0.278967 | 0.278919 |
| minimacht 2018.07.27 (complete) | 4300810 | SAT | 0.505879 | 0.506747 |
| cosoco 1.12 (complete) | 4299751 | SAT | 1.15616 | 1.1563 |
| MiniCPFever 2018-04-29 (complete) | 4299753 | SAT | 3.26196 | 1.27461 |
| NACRE 1.0.4 (complete) | 4299754 | SAT | 3.47193 | 3.47297 |
| GG's minicp 2018-04-29 (complete) | 4299752 | SAT | 3.78527 | 1.48305 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299757 | SAT | 4.69301 | 2.61797 |
| slowpoke 2018-04-29 (incomplete) | 4299755 | SAT | 5.09801 | 3.06901 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299756 | SAT | 7.3504 | 4.98367 |
| The dodo solver 2018-04-29 (complete) | 4299758 | SAT (TO) | 2520.04 | 2501.13 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] </list> <values> 17 8 12 4 8 25 4 0 18 4 11 1 14 20 0 0 11 5 0 13 6 1 0 19 4 11 0 8 0 2 7 8 11 11 4 20 18 8 13 4 4 18 </values> </instantiation>