| Name | GraphColoring/ GraphColoring-5-fullins-3_c18.xml |
| MD5SUM | eef3a44daff87ab56f58eeeb8cf69225 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 7 |
| Best CPU time to get the best result obtained on this benchmark | 0.358308 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 154 |
| Number of constraints | 792 |
| Number of domains | 1 |
| Minimum domain size | 154 |
| Maximum domain size | 154 |
| Distribution of domain sizes | [{"size":154,"count":154}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 28 |
| Distribution of variable degrees | [{"degree":5,"count":4},{"degree":6,"count":22},{"degree":7,"count":12},{"degree":8,"count":60},{"degree":11,"count":7},{"degree":17,"count":7},{"degree":18,"count":35},{"degree":28,"count":7}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":792}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 792 |
| Distribution of constraint types | [{"type":"intension","count":792}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4298406 | OPT | 7 | 0.358308 | 0.360495 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298411 | SAT | 7 | 303.84 | 300.574 |
| slowpoke 2018-04-29 (incomplete) | 4298409 | SAT (TO) | 7 | 2520.03 | 2509.02 |
| The dodo solver 2018-04-29 (complete) | 4298412 | SAT (TO) | 7 | 2520.08 | 2510.82 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298410 | SAT (TO) | 7 | 2520.1 | 2499.22 |
| GG's minicp 2018-04-29 (complete) | 4298407 | SAT (TO) | 7 | 2520.12 | 2500.62 |
| MiniCPFever 2018-04-29 (complete) | 4298408 | SAT (TO) | 153 | 2520.09 | 2507.62 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 7<instantiation type='solution' cost='7'> <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[15] x[16] x[17] x[18] x[19] x[1] x[20] 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 2 2 2 2 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 6 2 1 0 5 4 3 0 2 1 4 5 6 1 7 0 1 0 1 3 3 0 0 1 0 1 0 0 1 1 0 3 1 3 3 1 3 3 2 2 0 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 2 1 2 2 1 1 1 2 1 1 1 1 1 1 1 2 1 1 </values> </instantiation>