| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-games120.xml |
| MD5SUM | 98ca11257fbca258bae5688bfdd43595 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 0.94970602 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 120 |
| Number of constraints | 638 |
| Number of domains | 1 |
| Minimum domain size | 120 |
| Maximum domain size | 120 |
| Distribution of domain sizes | [{"size":120,"count":120}] |
| Minimum variable degree | 8 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":8,"count":1},{"degree":9,"count":5},{"degree":10,"count":15},{"degree":11,"count":26},{"degree":12,"count":47},{"degree":13,"count":21},{"degree":14,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":638}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 638 |
| Distribution of constraint types | [{"type":"intension","count":638}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259872 | OPT | 8 | 0.94970602 | 1.02449 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251660 | OPT | 8 | 0.968748 | 0.969464 |
| cosoco-mini 1.12 (complete) | 4267053 | OPT | 8 | 0.97550303 | 0.98038399 |
| Naxos 1.1.0 (complete) | 4251661 | SAT (TO) | 8 | 2400.01 | 2400 |
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[12] x[13] x[14] 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 0 4 1 0 0 2 1 0 1 4 7 0 3 3 0 4 3 2 1 1 2 0 5 1 1 1 2 3 3 1 1 8 6 1 5 3 2 2 0 1 2 3 0 2 1 0 5 1 4 0 0 5 4 3 7 7 2 4 7 0 7 0 7 1 3 3 6 4 6 5 2 1 2 2 0 2 3 3 3 5 0 4 2 3 2 4 4 4 2 2 6 3 0 0 1 2 1 6 3 5 0 3 7 4 3 4 5 4 8 3 1 4 6 5 6 2 6 5 0 </values> </instantiation>