| Name | SumColoring/ SumColoring-dsjc-125-5_c18.xml |
| MD5SUM | 08115146c0ac9b7e4849c5cb62d96e41 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 1094 |
| Best CPU time to get the best result obtained on this benchmark | 19912 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 125 |
| Number of constraints | 3891 |
| Number of domains | 1 |
| Minimum domain size | 125 |
| Maximum domain size | 125 |
| Distribution of domain sizes | [{"size":125,"count":125}] |
| Minimum variable degree | 52 |
| Maximum variable degree | 76 |
| Distribution of variable degrees | [{"degree":52,"count":2},{"degree":54,"count":3},{"degree":55,"count":3},{"degree":56,"count":4},{"degree":57,"count":7},{"degree":58,"count":6},{"degree":59,"count":7},{"degree":60,"count":6},{"degree":61,"count":12},{"degree":62,"count":11},{"degree":63,"count":6},{"degree":64,"count":7},{"degree":65,"count":11},{"degree":66,"count":6},{"degree":67,"count":4},{"degree":68,"count":8},{"degree":69,"count":6},{"degree":70,"count":5},{"degree":71,"count":2},{"degree":72,"count":2},{"degree":73,"count":2},{"degree":74,"count":3},{"degree":75,"count":1},{"degree":76,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":3891}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 3891 |
| Distribution of constraint types | [{"type":"intension","count":3891}] |
| 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) | 4297584 | SAT (TO) | 1094 | 19912 | 2520.04 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308940 | SAT (TO) | 12378 | 20056.6 | 2520.35 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291171 | SAT (TO) | 12392 | 20052.5 | 2520.22 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1094<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] c[95] c[96] c[97] c[98] c[99] c[100] c[101] c[102] c[103] c[104] c[105] c[106] c[107] c[108] c[109] c[110] c[111] c[112] c[113] c[114] c[115] c[116] c[117] c[118] c[119] c[120] c[121] c[122] c[123] c[124] </list> <values>12 3 2 17 11 13 20 13 2 19 16 0 15 18 5 0 6 14 4 17 9 13 11 19 4 16 13 5 3 9 2 9 11 15 16 3 7 14 2 15 8 8 12 6 3 6 14 12 6 7 16 10 19 17 6 9 11 14 18 5 10 10 11 17 19 10 0 18 11 0 0 12 12 11 1 4 7 17 10 15 6 15 14 5 8 3 12 8 9 7 17 2 13 13 7 8 15 7 6 10 7 1 9 8 10 3 16 5 3 0 4 1 5 8 1 2 0 1 6 3 1 4 4 0 2 </values> </instantiation>