| Name | SumColoring/ SumColoring-dsjc-125-1_c18.xml |
| MD5SUM | e8035d4b0abecbc1a78dd1ff35d13fe4 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 228 |
| Best CPU time to get the best result obtained on this benchmark | 305.957 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 125 |
| Number of constraints | 736 |
| Number of domains | 1 |
| Minimum domain size | 125 |
| Maximum domain size | 125 |
| Distribution of domain sizes | [{"size":125,"count":125}] |
| Minimum variable degree | 6 |
| Maximum variable degree | 24 |
| Distribution of variable degrees | [{"degree":6,"count":1},{"degree":7,"count":3},{"degree":8,"count":5},{"degree":9,"count":12},{"degree":10,"count":12},{"degree":11,"count":16},{"degree":12,"count":12},{"degree":13,"count":16},{"degree":14,"count":15},{"degree":15,"count":7},{"degree":16,"count":8},{"degree":17,"count":9},{"degree":18,"count":1},{"degree":19,"count":4},{"degree":20,"count":3},{"degree":24,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":736}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 736 |
| Distribution of constraint types | [{"type":"intension","count":736}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298653 | SAT | 228 | 305.957 | 300.706 |
| MiniCPFever 2018-04-29 (complete) | 4298650 | SAT (TO) | 233 | 2520.11 | 2495.82 |
| cosoco 1.12 (complete) | 4298648 | SAT (TO) | 241 | 2520.08 | 2520.01 |
| The dodo solver 2018-04-29 (complete) | 4298654 | SAT (TO) | 253 | 2520.05 | 2470.32 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298652 | SAT (TO) | 270 | 2520.02 | 2505.22 |
| GG's minicp 2018-04-29 (complete) | 4298649 | SAT (TO) | 271 | 2520.04 | 2463.93 |
| slowpoke 2018-04-29 (incomplete) | 4298651 | SAT (TO) | 274 | 2520.06 | 2463.42 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 228<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> 0 3 0 2 1 0 1 4 1 0 4 1 3 4 0 2 4 2 2 2 0 1 2 3 1 0 2 0 2 3 1 1 3 2 4 1 0 3 4 1 3 3 1 3 1 2 5 1 2 0 5 5 4 0 3 2 2 1 1 0 3 5 1 4 2 3 2 0 3 3 0 3 2 2 1 0 2 0 1 2 1 3 4 5 0 2 1 1 0 0 5 4 2 2 1 0 4 3 1 2 0 0 0 1 0 0 0 0 2 1 0 2 1 0 3 1 1 4 2 4 0 2 3 4 3 </values> </instantiation>