| Name | QuadraticAssignment/ QuadraticAssignment-esc64a_c18.xml |
| MD5SUM | 88cd58dcc4a8523a6c3e6ee988ef86c5 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 58 |
| Best CPU time to get the best result obtained on this benchmark | 303.945 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 4160 |
| Number of constraints | 66 |
| Number of domains | 2 |
| Minimum domain size | 6 |
| Maximum domain size | 64 |
| Distribution of domain sizes | [{"size":6,"count":65},{"size":64,"count":64}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 13 |
| Distribution of variable degrees | [{"degree":0,"count":4031},{"degree":1,"count":42},{"degree":2,"count":71},{"degree":3,"count":4},{"degree":4,"count":1},{"degree":11,"count":9},{"degree":12,"count":1},{"degree":13,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":3,"count":65},{"arity":64,"count":1}] |
| Number of extensional constraints | 65 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":65},{"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) | 4298876 | SAT | 58 | 303.945 | 300.494 |
| GG's minicp 2018-04-29 (complete) | 4298872 | SAT (TO) | 58 | 2520.02 | 2475.92 |
| MiniCPFever 2018-04-29 (complete) | 4298873 | SAT (TO) | 58 | 2520.07 | 2474.41 |
| cosoco 1.12 (complete) | 4298871 | SAT (TO) | 58 | 2520.09 | 2519.9 |
| The dodo solver 2018-04-29 (complete) | 4298877 | SAT (TO) | 58 | 2520.09 | 2514.81 |
| slowpoke 2018-04-29 (incomplete) | 4298874 | SAT (TO) | 114 | 2520.03 | 2489.92 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298875 | SAT (TO) | 123 | 2520.12 | 2478.34 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 58<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] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] d[2][29] d[3][9] d[3][19] d[5][7] d[5][9] d[5][10] d[5][13] d[5][14] d[5][16] d[5][18] d[5][36] d[5][43] d[5][45] d[7][9] d[7][10] d[7][13] d[7][14] d[7][16] d[7][18] d[7][36] d[7][43] d[7][45] d[9][10] d[9][13] d[9][14] d[9][16] d[9][18] d[9][19] d[9][36] d[9][43] d[9][45] d[10][13] d[10][14] d[10][16] d[10][18] d[10][36] d[10][43] d[10][45] d[13][14] d[13][16] d[13][18] d[13][21] d[13][36] d[13][43] d[13][45] d[14][16] d[14][18] d[14][36] d[14][43] d[14][45] d[16][18] d[16][36] d[16][43] d[16][45] d[18][36] d[18][43] d[18][45] d[19][26] d[26][38] d[27][29] d[27][31] d[32][34] d[36][43] d[36][45] d[43][45] </list> <values> 0 1 2 10 4 5 3 7 6 14 39 8 9 13 15 17 46 25 37 11 16 12 21 24 26 20 27 22 28 18 30 23 31 29 63 33 38 32 19 35 40 34 42 45 36 47 43 50 48 41 44 49 51 54 53 56 52 57 55 58 59 60 61 62 0 0 0 0 2 1 0 1 3 0 2 1 2 1 0 1 0 2 1 1 2 1 2 1 0 0 3 1 1 2 1 2 1 1 0 0 1 0 0 2 1 0 3 0 1 1 2 2 1 0 2 0 1 0 1 0 1 0 0 0 0 0 2 1 0 </values> </instantiation>