| Name | Crossword/Crossword-m1c-words-puzzle/ Crossword-m1c-words-p20.xml |
| MD5SUM | 652ba5e791d0de7647c1c6f96b05e6d5 |
| 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.099547997 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 81 |
| Number of constraints | 24 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":52}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":0,"count":29},{"degree":2,"count":52}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":3,"count":8},{"arity":4,"count":8},{"arity":5,"count":4},{"arity":7,"count":4}] |
| Number of extensional constraints | 24 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":24}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4252720 | SAT | 0.085396998 | 0.211061 |
| miniBTD 2017-08-10 (complete) | 4264907 | SAT | 0.087185003 | 0.181445 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260167 | SAT | 0.099547997 | 0.162753 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252721 | SAT | 0.100082 | 0.182225 |
| cosoco-mini 1.12 (complete) | 4267348 | SAT | 0.104616 | 0.108589 |
| Naxos 1.1.0 (complete) | 4252722 | SAT | 0.20309401 | 0.30061299 |
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[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[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[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[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[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[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[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[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] </list> <values> 0 0 0 0 1 14 0 0 0 0 0 10 13 0 15 15 0 0 0 18 0 13 3 4 17 18 0 0 2 12 4 0 11 4 22 3 17 0 15 0 0 0 15 14 4 2 11 0 3 0 2 0 17 4 0 15 11 0 2 0 17 3 0 0 0 0 3 0 6 4 0 0 0 0 0 0 1 4 0 0 0 </values> </instantiation>