| Name | GraphColoring/GraphColoring-m1-fixed/ GraphColoring-qwhdec-o50-h825-bal-1.xml |
| MD5SUM | 61480520129ccedf9125f18e00ca3450 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 2500 |
| Number of constraints | 123326 |
| Number of domains | 1 |
| Minimum domain size | 2500 |
| Maximum domain size | 2500 |
| Distribution of domain sizes | [{"size":2500,"count":2500}] |
| Minimum variable degree | 100 |
| Maximum variable degree | 100 |
| Distribution of variable degrees | [{"degree":100,"count":2500}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 1675 |
| Distribution of constraint arities | [{"arity":1,"count":825},{"arity":2,"count":122500},{"arity":1675,"count":1}] |
| Number of extensional constraints | 825 |
| Number of intensional constraints | 122500 |
| Distribution of constraint types | [{"type":"extension","count":825},{"type":"intension","count":122500},{"type":"instantiation","count":1}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: