| Name | Kakuro/Kakuro-sumdiff-medium/ Kakuro-medium-055-sumdiff.xml |
| MD5SUM | 9a8db212b4ab115474de9ff8ac609ca3 |
| 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.010158 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 168 |
| Number of constraints | 132 |
| Number of domains | 1 |
| Minimum domain size | 9 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":9,"count":100}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":0,"count":68},{"degree":4,"count":100}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":64},{"arity":3,"count":28},{"arity":4,"count":20},{"arity":5,"count":12},{"arity":6,"count":8}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":66},{"type":"sum","count":66}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252263 | SAT | 0.008651 | 0.009232 |
| cosoco-mini 1.12 (complete) | 4267280 | SAT | 0.0087609999 | 0.0096500199 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260099 | SAT | 0.0090530002 | 0.120911 |
| Naxos 1.1.0 (complete) | 4252264 | SAT | 0.010158 | 0.010202 |
| miniBTD 2017-06-30 (complete) | 4252262 | SAT | 0.013247 | 0.013046 |
| miniBTD 2017-08-10 (complete) | 4264839 | SAT | 0.013842 | 0.111822 |
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[0][10] x[0][11] 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[1][10] x[1][11] 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[2][10] x[2][11] 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[3][10] x[3][11] 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[4][10] x[4][11] 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[5][10] x[5][11] 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[6][10] x[6][11] 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[7][10] x[7][11] 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[8][10] x[8][11] 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] x[9][10] x[9][11] x[10][0] x[10][1] x[10][2] x[10][3] x[10][4] x[10][5] x[10][6] x[10][7] x[10][8] x[10][9] x[10][10] x[10][11] x[11][0] x[11][1] x[11][2] x[11][3] x[11][4] x[11][5] x[11][6] x[11][7] x[11][8] x[11][9] x[11][10] x[11][11] x[12][0] x[12][1] x[12][2] x[12][3] x[12][4] x[12][5] x[12][6] x[12][7] x[12][8] x[12][9] x[12][10] x[12][11] x[13][0] x[13][1] x[13][2] x[13][3] x[13][4] x[13][5] x[13][6] x[13][7] x[13][8] x[13][9] x[13][10] x[13][11] </list> <values>* * * * * * * * * * * * * * * 1 8 * 7 9 * 7 1 * * * 6 8 9 * 6 7 9 8 5 * * 2 1 * 7 8 9 * 7 9 4 5 * 1 4 2 * 3 5 4 * * 2 1 * * 3 1 * * 4 2 6 1 3 * * 2 5 3 1 * 8 3 7 2 * * * 1 2 * 3 1 * 1 8 * 4 1 * * * 9 5 4 7 * 9 8 5 3 * * 8 7 2 3 6 * * 9 8 * * 9 7 * * 2 1 4 * 6 9 8 * 1 4 2 3 * 8 9 6 * 7 9 * * 6 3 1 2 4 * 4 8 6 * * * 9 8 * 1 3 * 2 9 * * </values> </instantiation>