Name | SumColoring/ SumColoring-1-fullins-4_c18.xml |
MD5SUM | ce812152122c21d5982c9c6047fc1378 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 83 |
Best CPU time to get the best result obtained on this benchmark | 303.884 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 93 |
Number of constraints | 593 |
Number of domains | 1 |
Minimum domain size | 93 |
Maximum domain size | 93 |
Distribution of domain sizes | [{"size":93,"count":93}] |
Minimum variable degree | 7 |
Maximum variable degree | 33 |
Distribution of variable degrees | [{"degree":7,"count":4},{"degree":8,"count":6},{"degree":9,"count":11},{"degree":10,"count":8},{"degree":11,"count":9},{"degree":12,"count":9},{"degree":13,"count":7},{"degree":14,"count":10},{"degree":15,"count":4},{"degree":16,"count":4},{"degree":17,"count":3},{"degree":18,"count":3},{"degree":19,"count":3},{"degree":20,"count":3},{"degree":23,"count":3},{"degree":24,"count":3},{"degree":33,"count":3}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":593}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 593 |
Distribution of constraint types | [{"type":"intension","count":593}] |
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) | 4298667 | SAT | 83 | 303.884 | 300.513 |
MiniCPFever 2018-04-29 (complete) | 4298664 | SAT (TO) | 83 | 2520.07 | 2499.72 |
cosoco 1.12 (complete) | 4298662 | SAT (TO) | 84 | 2519.74 | 2520.01 |
The dodo solver 2018-04-29 (complete) | 4298668 | SAT (TO) | 87 | 2520.07 | 2468.51 |
slowpoke 2018-04-29 (incomplete) | 4298665 | SAT (TO) | 105 | 2520.06 | 2464.53 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298666 | SAT (TO) | 111 | 2520.04 | 2499.72 |
GG's minicp 2018-04-29 (complete) | 4298663 | SAT (TO) | 117 | 2520.04 | 2464.51 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 83<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] </list> <values> 1 3 4 3 1 1 3 1 4 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 1 2 1 2 2 2 1 1 2 1 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 3 1 2 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 0 2 </values> </instantiation>