| Name | Kakuro/Kakuro-sumdiff-easy/ Kakuro-easy-015-sumdiff.xml |
| MD5SUM | 1146004309082972e5d77911a227550f |
| 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.0071410001 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 140 |
| Number of constraints | 108 |
| Number of domains | 1 |
| Minimum domain size | 9 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":9,"count":82}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":0,"count":58},{"degree":4,"count":82}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":2,"count":44},{"arity":3,"count":24},{"arity":4,"count":32},{"arity":5,"count":8}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":54},{"type":"sum","count":54}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252242 | SAT | 0.00695 | 0.00772589 |
| cosoco-mini 1.12 (complete) | 4267276 | SAT | 0.0071410001 | 0.0079449499 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260095 | SAT | 0.0076179998 | 0.113965 |
| Naxos 1.1.0 (complete) | 4252243 | SAT | 0.008191 | 0.00981992 |
| miniBTD 2017-06-30 (complete) | 4252241 | SAT | 0.009156 | 0.00952108 |
| miniBTD 2017-08-10 (complete) | 4264835 | SAT | 0.010471 | 0.081886098 |
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[0][12] x[0][13] 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[1][12] x[1][13] 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[2][12] x[2][13] 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[3][12] x[3][13] 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[4][12] x[4][13] 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[5][12] x[5][13] 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[6][12] x[6][13] 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[7][12] x[7][13] 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[8][12] x[8][13] 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[9][12] x[9][13] </list> <values>* * * * * * * * * * * * * * * 3 2 * 2 8 1 * * * 7 9 * * * 5 1 * 1 9 3 4 * 1 6 7 9 8 * 9 4 5 3 * * 1 6 2 4 * 7 9 * * 3 1 * 3 1 2 5 * 9 7 8 * * * * 9 7 8 5 * 7 6 8 9 * * * * 6 7 1 * 2 1 4 3 * 8 3 * * 7 9 * 4 1 3 2 * * 3 6 4 2 * 9 8 4 6 3 * 4 3 2 1 * 1 3 * * * 1 3 * * * 1 4 2 * 2 1 </values> </instantiation>