| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-queen8-12.xml |
| MD5SUM | 0f2e0cc847fead705bd6876ff81c3284 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 11 |
| Best CPU time to get the best result obtained on this benchmark | 29.416 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 96 |
| Number of constraints | 1368 |
| Number of domains | 1 |
| Minimum domain size | 96 |
| Maximum domain size | 96 |
| Distribution of domain sizes | [{"size":96,"count":96}] |
| Minimum variable degree | 26 |
| Maximum variable degree | 33 |
| Distribution of variable degrees | [{"degree":26,"count":16},{"degree":27,"count":4},{"degree":28,"count":16},{"degree":29,"count":8},{"degree":30,"count":20},{"degree":31,"count":8},{"degree":32,"count":12},{"degree":33,"count":12}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":1368}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1368 |
| Distribution of constraint types | [{"type":"intension","count":1368}] |
| 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) | 4407535 | OPT | 11 | 29.416 | 29.4833 |
| cosoco 2 (complete) | 4394668 | OPT | 11 | 1306.23 | 1306.38 |
| cosoco 2.0 (complete) | 4397513 | OPT | 11 | 1310.37 | 1310.46 |
| cosoco 2.0 (complete) | 4408773 | OPT | 11 | 1317.4 | 1317.52 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 11<instantiation> <list> x[] </list> <values> 10 3 11 2 5 0 6 1 8 4 7 9 4 8 6 1 9 2 5 10 7 0 11 3 0 7 2 4 8 3 1 9 11 10 6 5 1 10 5 3 7 9 8 6 4 2 0 11 3 6 4 8 11 5 10 7 0 1 9 2 2 11 9 7 10 4 0 5 6 8 3 1 7 4 0 11 2 1 9 8 3 5 10 6 11 5 1 9 3 8 2 0 10 6 4 7 </values> </instantiation>