| Name | Crossword/Crossword-m1c-ogd-puzzle/ Crossword-m1c-ogd-p14.xml |
| MD5SUM | 6bc055ae6ee811181fc9348d6866c0aa |
| 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.097107 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 28 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":62}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":0,"count":38},{"degree":2,"count":62}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":3,"count":8},{"arity":4,"count":8},{"arity":5,"count":8},{"arity":7,"count":4}] |
| Number of extensional constraints | 28 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":28}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391775 | SAT | 0.097107 | 0.097542 |
| NACRE 1.0.5-Hybrid (complete) | 4391375 | SAT | 0.240749 | 0.241272 |
| NACRE 1.0.5 (complete) | 4391575 | SAT | 0.242293 | 0.246864 |
| cosoco 2 (complete) | 4389975 | SAT | 0.315068 | 0.318273 |
| cosoco 2.0 (complete) | 4397255 | SAT | 0.316314 | 0.31896 |
| cosoco 2.0 (complete) | 4408515 | SAT | 0.316703 | 0.321045 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407837 | SAT | 6.33416 | 6.34151 |
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[0][8] x[0][9] 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[1][8] x[1][9] 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[2][8] x[2][9] 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[3][8] x[3][9] 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[4][8] x[4][9] 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[5][8] x[5][9] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[7][9] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] x[8][9] x[9][0] x[9][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8] x[9][9] </list> <values> 0 0 0 5 0 0 0 0 0 0 0 0 0 20 1 8 13 0 0 0 0 0 4 17 0 19 4 18 0 0 0 3 17 4 19 0 0 0 0 18 1 14 14 19 0 0 0 0 1 2 17 13 1 0 0 0 0 11 4 0 8 2 8 0 0 18 7 14 17 19 0 0 2 0 1 8 0 8 18 0 0 0 0 0 11 20 13 18 0 0 0 0 0 18 4 12 0 0 0 0 </values> </instantiation>