| Name | QuadraticAssignment/ QuadraticAssignment-esc128_c18.xml |
| MD5SUM | 76ce32fb4bedcb1ec6c5e9897c61dbaf |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 32 |
| Best CPU time to get the best result obtained on this benchmark | 2520.12 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 16512 |
| Number of constraints | 63 |
| Number of domains | 2 |
| Minimum domain size | 7 |
| Maximum domain size | 128 |
| Distribution of domain sizes | [{"size":7,"count":62},{"size":128,"count":128}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":0,"count":16322},{"degree":1,"count":97},{"degree":2,"count":68},{"degree":3,"count":5},{"degree":4,"count":5},{"degree":5,"count":2},{"degree":6,"count":4},{"degree":8,"count":8},{"degree":10,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 128 |
| Distribution of constraint arities | [{"arity":3,"count":62},{"arity":128,"count":1}] |
| Number of extensional constraints | 62 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":62},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| GG's minicp 2018-04-29 (complete) | 4298921 | SAT (TO) | 32 | 2520.12 | 2476.82 |
| MiniCPFever 2018-04-29 (complete) | 4298922 | SAT (TO) | 32 | 2520.12 | 2472.41 |
| The dodo solver 2018-04-29 (complete) | 4298926 | SAT (TO) | 36 | 2520.13 | 2514.02 |
| cosoco 1.12 (complete) | 4298920 | SAT (TO) | 42 | 2520.1 | 2519.9 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298925 | SAT | 50 | 305.886 | 300.665 |
| slowpoke 2018-04-29 (incomplete) | 4298923 | SAT (TO) | 77 | 2520.11 | 2474.51 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298924 | SAT (TO) | 80 | 2520.05 | 2474.04 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 32<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] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[110] x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] d[4][27] d[4][86] d[4][112] d[13][15] d[30][32] d[30][34] d[30][35] d[32][34] d[32][35] d[34][35] d[35][42] d[35][79] d[39][41] d[39][42] d[41][42] d[42][79] d[46][47] d[46][52] d[46][86] d[46][87] d[46][93] d[47][50] d[50][52] d[52][86] d[52][87] d[52][93] d[61][63] d[65][68] d[65][70] d[65][72] d[65][74] d[65][76] d[65][78] d[65][79] d[68][70] d[68][72] d[68][74] d[68][76] d[68][78] d[68][79] d[70][72] d[70][74] d[70][76] d[70][78] d[70][79] d[72][74] d[72][76] d[72][78] d[72][79] d[74][76] d[74][78] d[74][79] d[76][78] d[76][79] d[78][79] d[80][86] d[80][93] d[86][87] d[86][93] d[86][112] d[87][93] d[110][112] </list> <values> 25 30 35 32 10 33 28 29 34 36 38 37 39 4 41 6 43 42 45 47 49 48 50 51 52 53 55 2 54 56 16 57 21 58 20 17 59 60 61 18 62 22 19 63 64 65 12 14 66 67 46 68 44 69 70 71 74 72 73 75 76 23 77 31 78 1 79 80 11 81 9 82 13 83 5 84 15 86 7 3 24 85 87 88 89 90 8 0 91 92 93 94 95 40 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 27 112 26 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 0 0 0 0 1 0 0 0 0 1 0 1 0 0 1 0 0 0 0 1 1 0 0 1 2 0 0 1 0 1 0 2 1 0 0 1 2 0 1 0 0 1 1 2 1 0 0 1 2 1 0 1 0 1 0 0 1 0 0 1 1 0 </values> </instantiation>