| Name | SumColoring/ SumColoring-myciel6_c18.xml |
| MD5SUM | 12e75aa9ea5684230fdaa5ddf97691cc |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 105 |
| Best CPU time to get the best result obtained on this benchmark | 19964 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 95 |
| Number of constraints | 755 |
| Number of domains | 1 |
| Minimum domain size | 95 |
| Maximum domain size | 95 |
| Distribution of domain sizes | [{"size":95,"count":95}] |
| Minimum variable degree | 7 |
| Maximum variable degree | 48 |
| Distribution of variable degrees | [{"degree":7,"count":5},{"degree":8,"count":5},{"degree":9,"count":6},{"degree":10,"count":5},{"degree":11,"count":10},{"degree":12,"count":5},{"degree":13,"count":6},{"degree":14,"count":7},{"degree":15,"count":6},{"degree":17,"count":5},{"degree":18,"count":5},{"degree":19,"count":5},{"degree":21,"count":5},{"degree":22,"count":1},{"degree":23,"count":1},{"degree":24,"count":1},{"degree":25,"count":8},{"degree":33,"count":5},{"degree":41,"count":1},{"degree":45,"count":1},{"degree":47,"count":1},{"degree":48,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":755}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 755 |
| Distribution of constraint types | [{"type":"intension","count":755}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297592 | SAT (TO) | 105 | 19964 | 2520.05 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291179 | SAT (TO) | 3480 | 20056.8 | 2520.32 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308948 | SAT (TO) | 3503 | 20061.1 | 2520.29 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 105<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] </list> <values>2 4 3 3 4 2 4 2 6 2 3 2 1 3 1 5 2 1 2 1 2 3 4 2 1 3 1 4 2 1 2 1 2 3 1 1 1 1 1 1 1 1 1 1 1 4 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 </values> </instantiation>