| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K09-P07.xml |
| MD5SUM | 77d215e563c424ff51075488b165aa80 |
| 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 | 684 |
| Number of constraints | 308 |
| Number of domains | 2 |
| Minimum domain size | 306 |
| Maximum domain size | 307 |
| Distribution of domain sizes | [{"size":306,"count":306},{"size":307,"count":63}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":0,"count":315},{"degree":2,"count":306},{"degree":10,"count":18},{"degree":11,"count":45}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 306 |
| Distribution of constraint arities | [{"arity":3,"count":306},{"arity":63,"count":1},{"arity":306,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 306 |
| Distribution of constraint types | [{"type":"intension","count":306},{"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: