| Name | GracefulGraph/ GracefulGraph-K04-P02_c18.xml |
| MD5SUM | df122225b0586fd0ab127ca5658303c8 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.023731 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 44 |
| Number of constraints | 18 |
| Number of domains | 2 |
| Minimum domain size | 16 |
| Maximum domain size | 17 |
| Distribution of domain sizes | [{"size":16,"count":16},{"size":17,"count":8}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":0,"count":20},{"degree":2,"count":16},{"degree":5,"count":8}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":3,"count":16},{"arity":8,"count":1},{"arity":16,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 16 |
| Distribution of constraint types | [{"type":"intension","count":16},{"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:<instantiation type="solution"> <list> cn[0][0] cn[0][1] cn[0][2] cn[0][3] cn[1][0] cn[1][1] cn[1][2] cn[1][3] ce[0][0][0] ce[0][0][1] ce[0][0][2] ce[0][0][3] ce[0][1][0] ce[0][1][1] ce[0][1][2] ce[0][1][3] ce[0][2][0] ce[0][2][1] ce[0][2][2] ce[0][2][3] ce[0][3][0] ce[0][3][1] ce[0][3][2] ce[0][3][3] ce[1][0][0] ce[1][0][1] ce[1][0][2] ce[1][0][3] ce[1][1][0] ce[1][1][1] ce[1][1][2] ce[1][1][3] ce[1][2][0] ce[1][2][1] ce[1][2][2] ce[1][2][3] ce[1][3][0] ce[1][3][1] ce[1][3][2] ce[1][3][3] cie[0][0] cie[0][1] cie[0][2] cie[0][3] </list> <values> 0 1 16 13 10 15 8 4 * 1 16 13 * * 15 12 * * * 3 * * * * * 5 2 6 * * 7 11 * * * 4 * * * * 10 14 8 9 </values> </instantiation>