| 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 | 1010 |
| Best CPU time to get the best result obtained on this benchmark | 2520.1 |
| 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 |
|---|---|---|---|---|---|
| MiniCPFever 2018-04-29 (complete) | 4298706 | SAT (TO) | 1010 | 2520.1 | 2488.32 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298709 | SAT | 1111 | 309.153 | 302.581 |
| cosoco 1.12 (complete) | 4298704 | SAT (TO) | 1123 | 2520.07 | 2520.01 |
| The dodo solver 2018-04-29 (complete) | 4298710 | SAT (TO) | 1125 | 2520.06 | 2454.13 |
| GG's minicp 2018-04-29 (complete) | 4298705 | SAT (TO) | 1256 | 2520.09 | 2458.92 |
| slowpoke 2018-04-29 (incomplete) | 4298707 | SAT (TO) | 1289 | 2520.06 | 2492.22 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298708 | SAT (TO) | 1289 | 2520.1 | 2497.52 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1010<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> 16 4 14 5 17 12 6 16 15 17 6 12 0 15 15 6 18 18 2 5 2 12 7 18 9 11 0 15 11 3 0 3 7 16 11 5 11 4 3 13 4 3 2 0 1 10 4 14 0 10 11 18 1 5 0 8 1 9 9 15 3 15 7 6 4 10 2 12 13 6 12 8 14 6 7 14 9 8 8 3 10 13 12 19 13 5 10 4 2 3 1 3 7 2 1 2 6 1 4 14 9 8 10 14 0 5 11 8 5 4 11 7 1 17 8 6 12 12 0 13 7 13 9 10 6 </values> </instantiation>