Name | SumColoring/ SumColoring-dsjc-250-5_c18.xml |
MD5SUM | 6d15d8403aebe79e9693643b2fca1a5e |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 3754 |
Best CPU time to get the best result obtained on this benchmark | 2520.13 |
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 SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 3662<instantiation> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[40] c[41] c[42] c[43] c[44] c[45] c[46] c[47] c[48] c[49] c[50] c[51] c[52] c[53] c[54] c[55] c[56] c[57] c[58] c[59] c[60] c[61] c[62] c[63] c[64] c[65] c[66] c[67] c[68] c[69] c[70] c[71] c[72] c[73] c[74] c[75] c[76] c[77] c[78] c[79] c[80] c[81] c[82] c[83] c[84] c[85] c[86] c[87] c[88] c[89] c[90] c[91] c[92] c[93] c[94] c[95] c[96] c[97] c[98] c[99] c[100] c[101] c[102] c[103] c[104] c[105] c[106] c[107] c[108] c[109] c[110] c[111] c[112] c[113] c[114] c[115] c[116] c[117] c[118] c[119] c[120] c[121] c[122] c[123] c[124] c[125] c[126] c[127] c[128] c[129] c[130] c[131] c[132] c[133] c[134] c[135] c[136] c[137] c[138] c[139] c[140] c[141] c[142] c[143] c[144] c[145] c[146] c[147] c[148] c[149] c[150] c[151] c[152] c[153] c[154] c[155] c[156] c[157] c[158] c[159] c[160] c[161] c[162] c[163] c[164] c[165] c[166] c[167] c[168] c[169] c[170] c[171] c[172] c[173] c[174] c[175] c[176] c[177] c[178] c[179] c[180] c[181] c[182] c[183] c[184] c[185] c[186] c[187] c[188] c[189] c[190] c[191] c[192] c[193] c[194] c[195] c[196] c[197] c[198] c[199] c[200] c[201] c[202] c[203] c[204] c[205] c[206] c[207] c[208] c[209] c[210] c[211] c[212] c[213] c[214] c[215] c[216] c[217] c[218] c[219] c[220] c[221] c[222] c[223] c[224] c[225] c[226] c[227] c[228] c[229] c[230] c[231] c[232] c[233] c[234] c[235] c[236] c[237] c[238] c[239] c[240] c[241] c[242] c[243] c[244] c[245] c[246] c[247] c[248] c[249] </list> <values> 11 7 25 4 22 0 17 13 0 14 18 1 24 9 19 3 12 7 27 13 29 14 3 10 11 6 3 20 28 3 22 8 4 26 25 28 12 5 24 24 5 5 2 11 25 11 9 16 34 21 2 13 16 1 4 22 6 15 6 6 4 31 28 19 23 16 10 16 0 12 26 22 21 15 10 30 30 15 10 0 5 27 13 29 14 30 6 17 8 11 4 12 18 17 26 8 16 19 20 25 9 14 23 8 33 4 20 11 2 6 31 12 16 13 17 14 3 17 27 16 8 29 7 5 2 3 22 23 10 18 10 14 6 21 24 26 11 27 10 0 21 23 23 32 7 12 5 29 19 25 17 26 11 0 7 29 23 1 16 17 4 22 18 4 15 18 25 2 25 6 4 9 30 19 19 1 13 8 21 27 15 2 24 8 15 23 20 7 9 14 16 31 23 29 5 20 1 28 13 14 20 5 30 2 32 7 17 25 32 26 24 9 31 33 15 2 1 0 9 19 1 8 21 27 18 1 1 31 2 1 4 18 0 12 12 19 18 7 21 5 5 3 11 0 21 6 20 28 26 10 </values> </instantiation>