| Name | SumColoring/ SumColoring-myciel4_c18.xml |
| MD5SUM | b2986e349e6e3d69d494bfde8c7eda2a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 22 |
| Best CPU time to get the best result obtained on this benchmark | 0.236376 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 23 |
| Number of constraints | 71 |
| Number of domains | 1 |
| Minimum domain size | 23 |
| Maximum domain size | 23 |
| Distribution of domain sizes | [{"size":23,"count":23}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":5,"count":5},{"degree":6,"count":5},{"degree":7,"count":6},{"degree":9,"count":5},{"degree":11,"count":1},{"degree":12,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":71}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 71 |
| Distribution of constraint types | [{"type":"intension","count":71}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4298718 | OPT | 22 | 0.236376 | 0.237851 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298722 | OPT | 22 | 20.8101 | 19.0525 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298723 | SAT | 22 | 302.738 | 300.348 |
| slowpoke 2018-04-29 (incomplete) | 4298721 | SAT (TO) | 22 | 2520.03 | 2509.71 |
| MiniCPFever 2018-04-29 (complete) | 4298720 | SAT (TO) | 22 | 2520.05 | 2456.91 |
| The dodo solver 2018-04-29 (complete) | 4298724 | SAT (TO) | 22 | 2520.09 | 2500.91 |
| GG's minicp 2018-04-29 (complete) | 4298719 | SAT (TO) | 22 | 2520.11 | 2496.91 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 22<instantiation type='solution' cost='22'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[20] c[21] c[22] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] </list> <values>3 2 0 0 0 0 0 0 0 0 0 4 0 0 1 2 2 3 1 1 1 1 1 </values> </instantiation>