| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-zeroin-i-2.xml |
| MD5SUM | a04f0997626ec1f3044856c4dbf73ce4 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 29 |
| Best CPU time to get the best result obtained on this benchmark | 2400.03 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 211 |
| Number of constraints | 3541 |
| Number of domains | 1 |
| Minimum domain size | 211 |
| Maximum domain size | 211 |
| Distribution of domain sizes | [{"size":211,"count":211}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 141 |
| Distribution of variable degrees | [{"degree":1,"count":54},{"degree":18,"count":4},{"degree":19,"count":6},{"degree":20,"count":3},{"degree":21,"count":1},{"degree":22,"count":1},{"degree":23,"count":2},{"degree":24,"count":2},{"degree":25,"count":1},{"degree":26,"count":1},{"degree":27,"count":5},{"degree":28,"count":16},{"degree":29,"count":17},{"degree":30,"count":13},{"degree":31,"count":13},{"degree":32,"count":10},{"degree":33,"count":5},{"degree":34,"count":2},{"degree":35,"count":3},{"degree":36,"count":2},{"degree":37,"count":4},{"degree":38,"count":3},{"degree":39,"count":1},{"degree":41,"count":6},{"degree":42,"count":2},{"degree":43,"count":2},{"degree":44,"count":1},{"degree":45,"count":1},{"degree":47,"count":1},{"degree":49,"count":1},{"degree":64,"count":1},{"degree":67,"count":1},{"degree":79,"count":1},{"degree":81,"count":1},{"degree":96,"count":2},{"degree":100,"count":3},{"degree":115,"count":1},{"degree":122,"count":1},{"degree":124,"count":1},{"degree":126,"count":1},{"degree":128,"count":1},{"degree":130,"count":1},{"degree":131,"count":1},{"degree":132,"count":1},{"degree":134,"count":1},{"degree":135,"count":1},{"degree":136,"count":5},{"degree":141,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":3541}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 3541 |
| Distribution of constraint types | [{"type":"intension","count":3541}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 2.0 (complete) | 4408843 | SAT (TO) | 29 | 2400.03 | 2400.11 |
| cosoco 2 (complete) | 4394667 | SAT (TO) | 29 | 2400.05 | 2400.2 |
| cosoco 2.0 (complete) | 4397583 | SAT (TO) | 29 | 2400.08 | 2400.5 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407534 | ? (TO) | 2400.05 | 2400.11 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 29<instantiation type='solution' cost='29'> <list>x[0] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[10] x[110] x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[11] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128] x[129] x[12] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[13] x[140] x[141] x[142] x[143] x[144] x[145] x[146] x[147] x[148] x[149] x[14] x[150] x[151] x[152] x[153] x[154] x[155] x[156] x[157] x[158] x[159] x[15] x[160] x[161] x[162] x[163] x[164] x[165] x[166] x[167] x[168] x[169] x[16] x[170] x[171] x[172] x[173] x[174] x[175] x[176] x[177] x[178] x[179] x[17] x[180] x[181] x[182] x[183] x[184] x[185] x[186] x[187] x[188] x[189] x[18] x[190] x[191] x[192] x[193] x[194] x[195] x[196] x[197] x[198] x[199] x[19] x[1] x[200] x[201] x[202] x[203] x[204] x[205] x[206] x[207] x[208] x[209] x[20] x[210] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[3] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[4] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[5] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[6] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[7] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[8] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[9] </list> <values>0 1 0 0 0 0 1 1 2 1 1 12 0 0 0 0 0 0 2 0 0 26 13 27 26 0 26 2 26 26 1 1 1 14 25 24 23 20 2 22 21 18 1 9 15 18 23 22 21 26 26 26 26 0 0 16 24 24 0 1 0 1 0 0 0 0 17 0 26 27 26 26 23 18 18 0 18 0 0 23 26 27 26 27 28 27 27 27 17 26 26 22 22 22 22 0 0 0 27 24 26 18 29 23 23 28 23 28 23 18 25 3 23 23 0 23 23 23 18 18 0 2 16 1 13 14 15 12 4 3 2 5 6 4 7 8 18 0 0 19 0 0 0 0 5 20 0 21 0 22 0 1 23 0 0 6 24 0 0 25 0 27 18 0 1 2 7 1 1 1 1 1 1 1 19 20 1 8 1 1 1 1 1 1 1 1 10 1 9 9 1 18 11 1 0 0 2 0 2 10 18 2 0 0 0 0 0 0 2 0 11 </values> </instantiation>