| Name | GracefulGraph/ GracefulGraph-K07-P03_c18.xml |
| MD5SUM | ca21bb45cdf77f5b8e0b27a9f8e7d69e |
| Bench Category | CSP (decision 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 | 182 |
| Number of constraints | 79 |
| Number of domains | 2 |
| Minimum domain size | 77 |
| Maximum domain size | 78 |
| Distribution of domain sizes | [{"size":77,"count":77},{"size":78,"count":21}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":84},{"degree":2,"count":77},{"degree":8,"count":14},{"degree":9,"count":7}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 77 |
| Distribution of constraint arities | [{"arity":3,"count":77},{"arity":21,"count":1},{"arity":77,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 77 |
| Distribution of constraint types | [{"type":"intension","count":77},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: