| Name | Kakuro/Kakuro-sumdiff-easy/ Kakuro-easy-079-sumdiff.xml |
| MD5SUM | ca3cb4e4201b5b0bf39d1bab0662b894 |
| 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.010836 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 240 |
| Number of constraints | 208 |
| Number of domains | 1 |
| Minimum domain size | 9 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":9,"count":153}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":0,"count":87},{"degree":4,"count":153}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":112},{"arity":3,"count":38},{"arity":4,"count":32},{"arity":5,"count":10},{"arity":6,"count":16}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":104},{"type":"sum","count":104}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267277 | SAT | 0.010058 | 0.010989 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252236 | SAT | 0.010394 | 0.0112779 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260096 | SAT | 0.010836 | 0.115192 |
| Naxos 1.1.0 (complete) | 4252237 | SAT | 0.014019 | 0.0141769 |
| miniBTD 2017-06-30 (complete) | 4252235 | SAT | 0.025175 | 0.025585 |
| miniBTD 2017-08-10 (complete) | 4264836 | SAT | 0.026265999 | 0.123051 |
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] x[14][0] x[14][1] x[14][2] x[14][3] x[14][4] x[14][5] x[14][6] x[14][7] x[14][8] x[14][9] x[14][10] x[14][11] x[15][0] x[15][1] x[15][2] x[15][3] x[15][4] x[15][5] x[15][6] x[15][7] x[15][8] x[15][9] x[15][10] x[15][11] x[16][0] x[16][1] x[16][2] x[16][3] x[16][4] x[16][5] x[16][6] x[16][7] x[16][8] x[16][9] x[16][10] x[16][11] x[17][0] x[17][1] x[17][2] x[17][3] x[17][4] x[17][5] x[17][6] x[17][7] x[17][8] x[17][9] x[17][10] x[17][11] x[18][0] x[18][1] x[18][2] x[18][3] x[18][4] x[18][5] x[18][6] x[18][7] x[18][8] x[18][9] x[18][10] x[18][11] x[19][0] x[19][1] x[19][2] x[19][3] x[19][4] x[19][5] x[19][6] x[19][7] x[19][8] x[19][9] x[19][10] x[19][11] </list> <values>* * * * * * * * * * * * * 1 3 * 7 1 6 * 9 7 2 1 * 3 6 7 9 5 8 * 8 9 7 5 * * 8 9 * * 9 7 * * 9 7 * 6 7 8 9 4 * 3 1 2 4 6 * 3 5 * 7 1 * * 3 1 * * * 7 9 3 * 2 1 * * 6 1 9 * * * 1 2 * 4 7 1 5 2 3 * 7 9 * 9 8 * 9 3 4 * * * 2 5 * * 7 9 * 2 3 5 1 * 3 8 * 6 9 8 7 5 * 8 9 * 8 7 6 9 * 7 1 * * 9 5 * * * 7 8 9 * 8 2 * 7 6 * 8 1 3 4 7 6 * 1 3 * * * 9 6 5 * * 9 8 * 1 8 4 * * * 8 1 * * 7 9 * 4 1 * 4 6 9 8 7 * 4 7 1 5 2 * 7 9 * * 3 1 * * 2 7 * * 3 5 2 1 * 4 5 1 3 6 2 * 9 8 5 3 * 2 1 3 * 9 1 </values> </instantiation>