| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-david.xml |
| MD5SUM | 8881d200d983e9a0f6a660f33978a65e |
| 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 | 8.67038 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 87 |
| Number of constraints | 406 |
| Number of domains | 1 |
| Minimum domain size | 87 |
| Maximum domain size | 87 |
| Distribution of domain sizes | [{"size":87,"count":87}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 83 |
| Distribution of variable degrees | [{"degree":2,"count":10},{"degree":3,"count":5},{"degree":4,"count":7},{"degree":5,"count":5},{"degree":6,"count":6},{"degree":7,"count":10},{"degree":8,"count":4},{"degree":9,"count":5},{"degree":10,"count":9},{"degree":11,"count":1},{"degree":12,"count":4},{"degree":13,"count":2},{"degree":15,"count":3},{"degree":16,"count":2},{"degree":17,"count":4},{"degree":18,"count":2},{"degree":19,"count":1},{"degree":20,"count":1},{"degree":22,"count":1},{"degree":29,"count":1},{"degree":31,"count":1},{"degree":32,"count":1},{"degree":36,"count":1},{"degree":83,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":406}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 406 |
| Distribution of constraint types | [{"type":"intension","count":406}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407545 | OPT | 10 | 8.67038 | 8.67193 |
| cosoco 2 (complete) | 4394678 | OPT | 10 | 84.1787 | 84.2089 |
| cosoco 2.0 (complete) | 4397451 | OPT | 10 | 84.836 | 84.8414 |
| cosoco 2.0 (complete) | 4408711 | OPT | 10 | 85.4522 | 85.4601 |
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> <list> x[] </list> <values> 6 3 3 9 4 1 1 1 6 8 2 10 4 1 5 8 2 7 7 3 7 4 6 3 4 4 2 1 8 1 2 8 2 6 2 8 10 4 9 4 4 9 1 1 8 5 3 4 4 9 8 1 6 1 1 9 3 5 2 5 1 4 1 4 4 10 5 2 6 9 8 10 3 2 4 7 5 8 2 4 5 4 0 1 0 4 4 </values> </instantiation>