| Name | GraphColoring/ GraphColoring-qg-order100_c18.xml |
| MD5SUM | d2763c38ef24fdf1196893d726f1931a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 101 |
| Best CPU time to get the best result obtained on this benchmark | 2520.13 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 10000 |
| Number of constraints | 990000 |
| Number of domains | 1 |
| Minimum domain size | 10000 |
| Maximum domain size | 10000 |
| Distribution of domain sizes | [{"size":10000,"count":10000}] |
| Minimum variable degree | 199 |
| Maximum variable degree | 199 |
| Distribution of variable degrees | [{"degree":199,"count":10000}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":990000}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 990000 |
| Distribution of constraint types | [{"type":"intension","count":990000}] |
| 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: 101--too large--