Name | SumColoring/ SumColoring-dsjc-125-9_c18.xml |
MD5SUM | fde90c264558af66570e1c8b29991738 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 2532 |
Best CPU time to get the best result obtained on this benchmark | 2520.09 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 125 |
Number of constraints | 6961 |
Number of domains | 1 |
Minimum domain size | 125 |
Maximum domain size | 125 |
Distribution of domain sizes | [{"size":125,"count":125}] |
Minimum variable degree | 104 |
Maximum variable degree | 121 |
Distribution of variable degrees | [{"degree":104,"count":2},{"degree":105,"count":1},{"degree":106,"count":1},{"degree":107,"count":3},{"degree":108,"count":8},{"degree":109,"count":10},{"degree":110,"count":9},{"degree":111,"count":16},{"degree":112,"count":13},{"degree":113,"count":18},{"degree":114,"count":11},{"degree":115,"count":8},{"degree":116,"count":12},{"degree":117,"count":7},{"degree":118,"count":4},{"degree":119,"count":1},{"degree":121,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":6961}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 6961 |
Distribution of constraint types | [{"type":"intension","count":6961}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
MiniCPFever 2018-04-29 (complete) | 4298713 | SAT (TO) | 2532 | 2520.09 | 2492.82 |
cosoco 1.12 (complete) | 4298711 | SAT (TO) | 2797 | 2519.73 | 2520.01 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298716 | SAT | 2804 | 308.042 | 303.523 |
The dodo solver 2018-04-29 (complete) | 4298717 | SAT (TO) | 2823 | 2520.08 | 2466.12 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298715 | SAT (TO) | 3115 | 2520.04 | 2498.92 |
slowpoke 2018-04-29 (incomplete) | 4298714 | SAT (TO) | 3115 | 2520.1 | 2465.72 |
GG's minicp 2018-04-29 (complete) | 4298712 | SAT (TO) | 3135 | 2520.06 | 2464.32 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 2532<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> 3 26 4 12 14 32 13 2 44 40 28 19 15 11 12 21 5 9 20 16 20 31 14 25 15 35 3 22 10 30 18 29 14 13 11 34 16 19 12 9 31 26 17 7 1 23 23 41 6 23 33 11 2 30 34 42 40 37 32 33 19 34 36 26 42 39 24 3 37 0 16 8 21 5 30 1 8 38 35 28 15 29 9 17 27 13 18 4 25 4 41 0 26 31 27 20 2 0 28 39 45 10 14 2 6 21 25 43 36 6 38 18 22 22 7 24 27 7 8 10 32 43 5 1 17 </values> </instantiation>