| Name | GracefulGraph/ GracefulGraph-K06-P02_c18.xml |
| MD5SUM | 53e7831caef8c5f41b7e6921221d2be5 |
| 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 | 90 |
| Number of constraints | 38 |
| Number of domains | 2 |
| Minimum domain size | 36 |
| Maximum domain size | 37 |
| Distribution of domain sizes | [{"size":36,"count":36},{"size":37,"count":12}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":0,"count":42},{"degree":2,"count":36},{"degree":7,"count":12}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":3,"count":36},{"arity":12,"count":1},{"arity":36,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 36 |
| Distribution of constraint types | [{"type":"intension","count":36},{"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: