| Name | SumColoring/ SumColoring-myciel3_c18.xml |
| MD5SUM | 2a16ad2ecbd4987722397e2a286d7eb3 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 10 |
| Best CPU time to get the best result obtained on this benchmark | 0.008888 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 11 |
| Number of constraints | 20 |
| Number of domains | 1 |
| Minimum domain size | 11 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":11,"count":11}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":4,"count":5},{"degree":5,"count":5},{"degree":6,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":20}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 20 |
| Distribution of constraint types | [{"type":"intension","count":20}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 10<instantiation type="optimum" cost="10"> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] </list> <values> 2 1 2 3 1 0 0 0 0 0 1 </values> </instantiation>