| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-huck.xml |
| MD5SUM | d34e8a95a1772739b73fcfbe434c4441 |
| 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 | 7.33711 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 74 |
| Number of constraints | 301 |
| Number of domains | 1 |
| Minimum domain size | 74 |
| Maximum domain size | 74 |
| Distribution of domain sizes | [{"size":74,"count":74}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 54 |
| Distribution of variable degrees | [{"degree":2,"count":7},{"degree":3,"count":9},{"degree":4,"count":5},{"degree":5,"count":4},{"degree":6,"count":3},{"degree":7,"count":3},{"degree":8,"count":3},{"degree":9,"count":6},{"degree":10,"count":9},{"degree":11,"count":15},{"degree":12,"count":1},{"degree":14,"count":1},{"degree":17,"count":1},{"degree":19,"count":2},{"degree":20,"count":1},{"degree":21,"count":2},{"degree":26,"count":1},{"degree":54,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":301}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 301 |
| Distribution of constraint types | [{"type":"intension","count":301}] |
| 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) | 4407540 | OPT | 10 | 7.33711 | 7.34875 |
| cosoco 2.0 (complete) | 4397458 | OPT | 10 | 39.4207 | 39.4282 |
| cosoco 2.0 (complete) | 4408718 | OPT | 10 | 39.6629 | 39.6656 |
| cosoco 2 (complete) | 4394673 | OPT | 10 | 39.7789 | 39.7847 |
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> 2 2 8 8 8 5 9 5 10 9 6 5 4 2 0 1 6 4 6 4 3 5 0 2 1 8 0 8 10 5 3 1 6 10 8 2 8 0 2 5 1 8 0 6 1 4 9 1 0 3 5 9 3 0 7 4 3 0 9 5 0 6 6 1 0 9 4 9 6 8 0 1 2 9 </values> </instantiation>