| Name | Crossword/ Crossword-m18-ogd2008-vg-07-08_c18.xml |
| MD5SUM | 4cf2470ecfcea4403011c16b404a3a31 |
| 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 | 41.9072 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 56 |
| Number of constraints | 15 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":56}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":56}] |
| Minimum constraint arity | 7 |
| Maximum constraint arity | 8 |
| Distribution of constraint arities | [{"arity":7,"count":8},{"arity":8,"count":7}] |
| Number of extensional constraints | 15 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":15}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2018.07.27_3 (complete) | 4301163 | SAT | 41.9072 | 41.9146 |
| minimacht 2018.07.27 (complete) | 4300811 | SAT | 597.275 | 597.294 |
| miniBTD_12 2018.07.27_12 (complete) | 4300987 | SAT | 721.102 | 721.115 |
| cosoco 1.12 (complete) | 4299783 | SAT | 937.693 | 937.727 |
| GG's minicp 2018-04-29 (complete) | 4299784 | SAT | 1152.42 | 1141.08 |
| NACRE 1.0.4 (complete) | 4299786 | SAT | 1913.96 | 1914.05 |
| MiniCPFever 2018-04-29 (complete) | 4299785 | SAT | 2358.89 | 2314.19 |
| The dodo solver 2018-04-29 (complete) | 4299790 | SAT (TO) | 2520.05 | 2478.91 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299789 | ? (TO) | 2520.03 | 2516.02 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299788 | ? (TO) | 2520.03 | 2474.32 |
| slowpoke 2018-04-29 (incomplete) | 4299787 | ? (TO) | 2520.09 | 2515.02 |
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[0][7] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] </list> <values> 0 1 1 0 19 8 0 11 1 0 0 18 8 18 18 0 4 13 18 8 11 0 8 19 19 0 12 0 11 11 4 19 8 13 0 11 8 4 13 4 17 4 19 8 4 13 13 4 0 2 8 4 17 4 4 18 </values> </instantiation>