Name | SumColoring/ SumColoring-myciel5_c18.xml |
MD5SUM | 129cb36d1c9243226923c7f46c8f3d2b |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 46 |
Best CPU time to get the best result obtained on this benchmark | 251.958 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 47 |
Number of constraints | 236 |
Number of domains | 1 |
Minimum domain size | 47 |
Maximum domain size | 47 |
Distribution of domain sizes | [{"size":47,"count":47}] |
Minimum variable degree | 6 |
Maximum variable degree | 24 |
Distribution of variable degrees | [{"degree":6,"count":5},{"degree":7,"count":5},{"degree":8,"count":6},{"degree":9,"count":5},{"degree":10,"count":5},{"degree":11,"count":5},{"degree":12,"count":1},{"degree":13,"count":7},{"degree":17,"count":5},{"degree":21,"count":1},{"degree":23,"count":1},{"degree":24,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":236}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 236 |
Distribution of constraint types | [{"type":"intension","count":236}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Mistral-2.0 2018-08-01 (complete) | 4312556 | OPT | 46 | 118.26 | 118.27 |
cosoco 1.12 (complete) | 4301572 | SAT (TO) | 46 | 251.958 | 252.01 |
OscaR - Hybrid 2018-08-14 (complete) | 4310469 | SAT (TO) | 46 | 252.051 | 243.529 |
Concrete 3.9.2 (complete) | 4302493 | SAT (TO) | 46 | 252.136 | 234.737 |
OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310119 | SAT | 47 | 251.026 | 247.358 |
Concrete 3.9.2-SuperNG (complete) | 4302843 | SAT (TO) | 50 | 252.132 | 241.544 |
OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312329 | SAT | 51 | 250.653 | 247.363 |
Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301570 | SAT (TO) | 51 | 252.089 | 249.032 |
Sat4j-CSP 2018-07-11 (complete) | 4301571 | SAT (TO) | 71 | 252.23 | 247.927 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 46<instantiation type="optimum" cost="46"> <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] </list> <values> 4 3 5 3 4 2 2 2 2 2 3 1 1 1 1 1 1 1 1 1 1 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 1 </values> </instantiation>