| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-4-insertions-3.xml |
| MD5SUM | 681bcba91e68c7fd43dde01217071906 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 3 |
| Best CPU time to get the best result obtained on this benchmark | 4.94 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 79 |
| Number of constraints | 156 |
| Number of domains | 1 |
| Minimum domain size | 79 |
| Maximum domain size | 79 |
| Distribution of domain sizes | [{"size":79,"count":79}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":4,"count":13},{"degree":5,"count":65},{"degree":14,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":156}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 156 |
| Distribution of constraint types | [{"type":"intension","count":156}] |
| 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: 3<instantiation> <list> x[] </list> <values> 0 1 0 1 0 3 1 1 0 0 1 3 0 2 2 2 2 2 2 2 2 2 2 2 2 2 0 0 0 0 0 0 0 0 0 0 0 0 0 2 2 2 2 2 2 2 2 2 2 2 2 2 0 0 0 0 0 0 0 0 0 0 0 0 0 2 2 2 2 2 2 2 2 2 2 2 2 2 0 </values> </instantiation>