Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-dsjc-250-5.xml |
MD5SUM | ab305c524aabd76bb0e53710a597355c |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 33 |
Best CPU time to get the best result obtained on this benchmark | 2400.05 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 250 |
Number of constraints | 15668 |
Number of domains | 1 |
Minimum domain size | 250 |
Maximum domain size | 250 |
Distribution of domain sizes | [{"size":250,"count":250}] |
Minimum variable degree | 102 |
Maximum variable degree | 148 |
Distribution of variable degrees | [{"degree":102,"count":1},{"degree":110,"count":3},{"degree":111,"count":2},{"degree":112,"count":2},{"degree":113,"count":3},{"degree":114,"count":3},{"degree":115,"count":5},{"degree":116,"count":6},{"degree":117,"count":8},{"degree":118,"count":7},{"degree":119,"count":9},{"degree":120,"count":8},{"degree":121,"count":9},{"degree":122,"count":12},{"degree":123,"count":12},{"degree":124,"count":14},{"degree":125,"count":10},{"degree":126,"count":12},{"degree":127,"count":17},{"degree":128,"count":13},{"degree":129,"count":14},{"degree":130,"count":13},{"degree":131,"count":6},{"degree":132,"count":11},{"degree":133,"count":6},{"degree":134,"count":10},{"degree":135,"count":2},{"degree":136,"count":6},{"degree":137,"count":7},{"degree":138,"count":1},{"degree":139,"count":4},{"degree":140,"count":4},{"degree":141,"count":1},{"degree":142,"count":1},{"degree":143,"count":1},{"degree":144,"count":3},{"degree":145,"count":2},{"degree":146,"count":1},{"degree":148,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":15668}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 15668 |
Distribution of constraint types | [{"type":"intension","count":15668}] |
Optimization problem | YES |
Type of objective | min MAXIMUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 2.0 (complete) | 4408851 | SAT (TO) | 33 | 2400.05 | 2400.2 |
cosoco 2.0 (complete) | 4397591 | SAT (TO) | 33 | 2400.06 | 2400.01 |
cosoco 2 (complete) | 4394670 | SAT (TO) | 33 | 2400.09 | 2400.4 |
(reference) PicatSAT 2019-09-12 (complete) | 4407537 | ? (TO) | 2400.05 | 2399.81 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 33<instantiation type='solution' cost='33'> <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[211] x[212] x[213] x[214] x[215] x[216] x[217] x[218] x[219] x[21] x[220] x[221] x[222] x[223] x[224] x[225] x[226] x[227] x[228] x[229] x[22] x[230] x[231] x[232] x[233] x[234] x[235] x[236] x[237] x[238] x[239] x[23] x[240] x[241] x[242] x[243] x[244] x[245] x[246] x[247] x[248] x[249] 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>32 20 5 2 32 33 6 18 27 1 22 10 24 29 0 11 31 5 19 21 17 31 17 32 32 13 3 9 28 31 8 30 2 16 21 27 15 1 17 7 18 33 6 10 2 16 30 0 23 4 33 7 3 8 21 0 28 25 14 10 33 1 4 17 23 7 28 3 19 33 2 27 4 13 19 6 14 4 29 24 26 26 27 14 20 6 12 11 12 32 23 24 23 18 14 28 31 8 7 9 16 20 4 3 13 2 13 9 13 2 15 6 19 27 18 28 20 20 29 26 9 22 0 20 32 8 18 23 0 17 24 24 20 26 14 22 12 28 21 29 32 2 0 1 7 15 20 19 17 23 29 33 12 9 14 30 30 14 13 11 22 8 19 25 1 17 27 10 17 18 15 0 33 27 30 10 7 28 21 24 16 0 26 10 33 16 8 3 7 17 24 1 3 12 18 5 15 23 3 4 5 25 14 5 5 10 28 33 30 19 16 16 18 4 11 7 30 25 27 12 8 9 31 5 16 12 6 9 26 2 19 3 1 15 25 29 30 26 11 23 8 21 25 11 22 22 6 22 32 31 </values> </instantiation>