| Name | QuadraticAssignment/ QuadraticAssignment-had16_c18.xml |
| MD5SUM | da18cc2837c7f6c978868c79c6384271 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 1885 |
| Best CPU time to get the best result obtained on this benchmark | 302.889 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 272 |
| Number of constraints | 121 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":10,"count":120},{"size":16,"count":16}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 16 |
| Distribution of variable degrees | [{"degree":0,"count":136},{"degree":2,"count":120},{"degree":16,"count":16}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":3,"count":120},{"arity":16,"count":1}] |
| Number of extensional constraints | 120 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":120},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298904 | SAT | 1885 | 302.889 | 300.45 |
| MiniCPFever 2018-04-29 (complete) | 4298901 | SAT (TO) | 1908 | 2520.08 | 2499.43 |
| cosoco 1.12 (complete) | 4298899 | SAT (TO) | 1934 | 2519.92 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298903 | SAT (TO) | 1974 | 2520.02 | 2491.51 |
| slowpoke 2018-04-29 (incomplete) | 4298902 | SAT (TO) | 2020 | 2520.08 | 2510.52 |
| The dodo solver 2018-04-29 (complete) | 4298905 | SAT (TO) | 2021 | 2520.04 | 2517.03 |
| GG's minicp 2018-04-29 (complete) | 4298900 | SAT (TO) | 2026 | 2520.04 | 2511.61 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1885<instantiation> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[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[0][10] d[0][11] d[0][12] d[0][13] d[0][14] d[0][15] 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[1][10] d[1][11] d[1][12] d[1][13] d[1][14] d[1][15] d[2][3] d[2][4] d[2][5] d[2][6] d[2][7] d[2][8] d[2][9] d[2][10] d[2][11] d[2][12] d[2][13] d[2][14] d[2][15] d[3][4] d[3][5] d[3][6] d[3][7] d[3][8] d[3][9] d[3][10] d[3][11] d[3][12] d[3][13] d[3][14] d[3][15] d[4][5] d[4][6] d[4][7] d[4][8] d[4][9] d[4][10] d[4][11] d[4][12] d[4][13] d[4][14] d[4][15] d[5][6] d[5][7] d[5][8] d[5][9] d[5][10] d[5][11] d[5][12] d[5][13] d[5][14] d[5][15] d[6][7] d[6][8] d[6][9] d[6][10] d[6][11] d[6][12] d[6][13] d[6][14] d[6][15] d[7][8] d[7][9] d[7][10] d[7][11] d[7][12] d[7][13] d[7][14] d[7][15] d[8][9] d[8][10] d[8][11] d[8][12] d[8][13] d[8][14] d[8][15] d[9][10] d[9][11] d[9][12] d[9][13] d[9][14] d[9][15] d[10][11] d[10][12] d[10][13] d[10][14] d[10][15] d[11][12] d[11][13] d[11][14] d[11][15] d[12][13] d[12][14] d[12][15] d[13][14] d[13][15] d[14][15] </list> <values> 8 3 6 15 10 5 11 4 0 13 1 2 12 7 9 14 9 8 5 5 5 2 5 5 5 2 2 4 1 4 4 3 8 3 5 6 5 6 4 3 2 3 3 4 7 6 6 8 7 3 6 8 9 4 1 6 4 5 8 4 5 3 5 3 2 6 4 4 5 8 7 9 6 4 5 4 3 6 5 7 1 5 4 5 8 9 4 1 5 5 5 7 6 5 7 6 6 3 7 4 8 3 7 6 7 4 7 3 5 3 4 1 6 1 4 6 6 5 5 6 5 6 9 2 7 3 5 4 6 2 7 5 7 5 9 5 </values> </instantiation>