| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K13-P08.xml |
| MD5SUM | f6de09233a74707b341bbe4fbe6d65e2 |
| 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 | 1547 |
| Number of constraints | 717 |
| Number of domains | 2 |
| Minimum domain size | 715 |
| Maximum domain size | 716 |
| Distribution of domain sizes | [{"size":715,"count":715},{"size":716,"count":104}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 15 |
| Distribution of variable degrees | [{"degree":0,"count":728},{"degree":2,"count":715},{"degree":14,"count":26},{"degree":15,"count":78}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 715 |
| Distribution of constraint arities | [{"arity":3,"count":715},{"arity":104,"count":1},{"arity":715,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 715 |
| Distribution of constraint types | [{"type":"intension","count":715},{"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: