Name | GracefulGraph/ GracefulGraph-K07-P02_c18.xml |
MD5SUM | 9eecb1b3d8aa7dfc9df91bdaa7b8a2e7 |
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 | 119 |
Number of constraints | 51 |
Number of domains | 2 |
Minimum domain size | 49 |
Maximum domain size | 50 |
Distribution of domain sizes | [{"size":49,"count":49},{"size":50,"count":14}] |
Minimum variable degree | 0 |
Maximum variable degree | 8 |
Distribution of variable degrees | [{"degree":0,"count":56},{"degree":2,"count":49},{"degree":8,"count":14}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 49 |
Distribution of constraint arities | [{"arity":3,"count":49},{"arity":14,"count":1},{"arity":49,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 49 |
Distribution of constraint types | [{"type":"intension","count":49},{"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: