| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-dsjc-250-1.xml |
| MD5SUM | 4a78676e15c4a516bf0316b10322151a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 2400.02 |
| 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 MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267050 | SAT (TO) | 8 | 2400.02 | 2399.8999 |
| Naxos 1.1.0 (complete) | 4251679 | SAT (TO) | 8 | 2400.03 | 2400.1 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259869 | SAT (TO) | 8 | 2400.1001 | 2400.1001 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251678 | ? (TO) | 2400.01 | 2399.9 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 8<instantiation type='solution' cost='8'> <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>3 4 7 1 6 3 1 5 5 1 0 3 7 4 4 7 7 2 1 7 2 6 2 2 1 0 3 5 0 2 8 2 6 3 4 1 6 2 6 2 4 2 7 1 3 7 1 3 2 6 4 4 6 2 0 0 5 1 7 5 1 2 3 8 5 7 8 5 1 6 4 1 8 7 4 2 7 4 0 8 0 7 0 5 4 3 1 5 0 0 8 2 0 3 3 8 7 1 6 2 3 8 3 6 6 4 0 0 4 8 5 6 3 1 0 3 1 3 2 7 5 3 1 5 3 0 1 2 2 0 3 0 8 3 0 5 5 4 1 6 8 0 3 6 6 0 5 6 4 3 0 1 2 0 4 0 5 7 6 6 4 5 3 4 7 6 1 1 3 8 1 0 6 2 4 1 7 4 8 0 8 1 7 5 8 4 7 2 1 5 1 2 1 5 7 1 2 5 5 6 8 0 5 5 7 0 7 6 6 7 2 2 8 2 3 0 4 1 0 0 6 3 6 7 7 1 4 3 0 1 6 0 5 4 1 6 2 2 6 3 1 4 3 1 2 8 8 0 5 4 </values> </instantiation>