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