| Name | QuadraticAssignment/ QuadraticAssignment-esc16d_c18.xml |
| MD5SUM | 797dd3ed6ca3fcac5df6221abf320949 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 139.294 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 272 |
| Number of constraints | 22 |
| Number of domains | 2 |
| Minimum domain size | 4 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":4,"count":21},{"size":16,"count":16}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":0,"count":235},{"degree":1,"count":2},{"degree":2,"count":22},{"degree":3,"count":6},{"degree":4,"count":2},{"degree":5,"count":3},{"degree":6,"count":1},{"degree":7,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":3,"count":21},{"arity":16,"count":1}] |
| Number of extensional constraints | 21 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":21},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4298948 | OPT | 8 | 139.294 | 139.303 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298953 | SAT | 8 | 302.734 | 300.329 |
| GG's minicp 2018-04-29 (complete) | 4298949 | SAT (TO) | 8 | 2520.02 | 2504.31 |
| The dodo solver 2018-04-29 (complete) | 4298954 | SAT (TO) | 8 | 2520.03 | 2514.91 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298952 | SAT (TO) | 8 | 2520.05 | 2481.31 |
| slowpoke 2018-04-29 (incomplete) | 4298951 | SAT (TO) | 8 | 2520.09 | 2509.72 |
| MiniCPFever 2018-04-29 (complete) | 4298950 | SAT (TO) | 8 | 2520.1 | 2490.72 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 8<instantiation type='solution' cost='8'> <list>d[0][0] d[0][10] d[0][11] d[0][12] d[0][13] d[0][14] d[0][15] d[0][1] d[0][2] d[0][3] d[0][4] d[0][5] d[0][6] d[0][7] d[0][8] d[0][9] d[10][0] d[10][10] d[10][11] d[10][12] d[10][13] d[10][14] d[10][15] d[10][1] d[10][2] d[10][3] d[10][4] d[10][5] d[10][6] d[10][7] d[10][8] d[10][9] d[11][0] d[11][10] d[11][11] d[11][12] d[11][13] d[11][14] d[11][15] d[11][1] d[11][2] d[11][3] d[11][4] d[11][5] d[11][6] d[11][7] d[11][8] d[11][9] d[12][0] d[12][10] d[12][11] d[12][12] d[12][13] d[12][14] d[12][15] d[12][1] d[12][2] d[12][3] d[12][4] d[12][5] d[12][6] d[12][7] d[12][8] d[12][9] d[13][0] d[13][10] d[13][11] d[13][12] d[13][13] d[13][14] d[13][15] d[13][1] d[13][2] d[13][3] d[13][4] d[13][5] d[13][6] d[13][7] d[13][8] d[13][9] d[14][0] d[14][10] d[14][11] d[14][12] d[14][13] d[14][14] d[14][15] d[14][1] d[14][2] d[14][3] d[14][4] d[14][5] d[14][6] d[14][7] d[14][8] d[14][9] d[15][0] d[15][10] d[15][11] d[15][12] d[15][13] d[15][14] d[15][15] d[15][1] d[15][2] d[15][3] d[15][4] d[15][5] d[15][6] d[15][7] d[15][8] d[15][9] d[1][0] d[1][10] d[1][11] d[1][12] d[1][13] d[1][14] d[1][15] d[1][1] d[1][2] d[1][3] d[1][4] d[1][5] d[1][6] d[1][7] d[1][8] d[1][9] d[2][0] d[2][10] d[2][11] d[2][12] d[2][13] d[2][14] d[2][15] d[2][1] d[2][2] d[2][3] d[2][4] d[2][5] d[2][6] d[2][7] d[2][8] d[2][9] d[3][0] d[3][10] d[3][11] d[3][12] d[3][13] d[3][14] d[3][15] d[3][1] d[3][2] d[3][3] d[3][4] d[3][5] d[3][6] d[3][7] d[3][8] d[3][9] d[4][0] d[4][10] d[4][11] d[4][12] d[4][13] d[4][14] d[4][15] d[4][1] d[4][2] d[4][3] d[4][4] d[4][5] d[4][6] d[4][7] d[4][8] d[4][9] d[5][0] d[5][10] d[5][11] d[5][12] d[5][13] d[5][14] d[5][15] d[5][1] d[5][2] d[5][3] d[5][4] d[5][5] d[5][6] d[5][7] d[5][8] d[5][9] d[6][0] d[6][10] d[6][11] d[6][12] d[6][13] d[6][14] d[6][15] d[6][1] d[6][2] d[6][3] d[6][4] d[6][5] d[6][6] d[6][7] d[6][8] d[6][9] d[7][0] d[7][10] d[7][11] d[7][12] d[7][13] d[7][14] d[7][15] d[7][1] d[7][2] d[7][3] d[7][4] d[7][5] d[7][6] d[7][7] d[7][8] d[7][9] d[8][0] d[8][10] d[8][11] d[8][12] d[8][13] d[8][14] d[8][15] d[8][1] d[8][2] d[8][3] d[8][4] d[8][5] d[8][6] d[8][7] d[8][8] d[8][9] d[9][0] d[9][10] d[9][11] d[9][12] d[9][13] d[9][14] d[9][15] d[9][1] d[9][2] d[9][3] d[9][4] d[9][5] d[9][6] d[9][7] d[9][8] d[9][9] x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>* * * * * * * * * 0 0 * * * * * * * * * 0 * * * * * * * * * * * * * * 0 1 0 * * * * * * * * * * * * * * 0 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 1 * * 2 * * * * * * 1 * 0 * * * * 0 * 0 * * * * * * * * * * * * * * * * * * * * 1 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 1 * * 0 * * * * * * * * 0 * * * * * * * * * * * * * * * * 0 * * 0 * * 1 * * * * * * * * * * * 0 * * * * * * * * * * * * * * 1 9 7 15 11 5 14 2 13 0 3 12 4 10 6 8 </values> </instantiation>