| Name | GracefulGraph/ GracefulGraph-K04-P03_c18.xml |
| MD5SUM | 76f2570dac1ecc86f40824dfede26263 |
| 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.556125 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 68 |
| Number of constraints | 28 |
| Number of domains | 2 |
| Minimum domain size | 26 |
| Maximum domain size | 27 |
| Distribution of domain sizes | [{"size":26,"count":26},{"size":27,"count":12}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":30},{"degree":2,"count":26},{"degree":5,"count":8},{"degree":6,"count":4}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 26 |
| Distribution of constraint arities | [{"arity":3,"count":26},{"arity":12,"count":1},{"arity":26,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 26 |
| Distribution of constraint types | [{"type":"intension","count":26},{"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] cn[2][0] cn[2][1] cn[2][2] cn[2][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] ce[2][0][0] ce[2][0][1] ce[2][0][2] ce[2][0][3] ce[2][1][0] ce[2][1][1] ce[2][1][2] ce[2][1][3] ce[2][2][0] ce[2][2][1] ce[2][2][2] ce[2][2][3] ce[2][3][0] ce[2][3][1] ce[2][3][2] ce[2][3][3] cie[0][0] cie[0][1] cie[0][2] cie[0][3] cie[1][0] cie[1][1] cie[1][2] cie[1][3] </list> <values> 21 12 2 16 3 1 25 0 20 13 5 26 * 9 19 5 * * 10 4 * * * 14 * * * * * 2 22 3 * * 24 1 * * * 25 * * * * * 7 15 6 * * 8 13 * * * 21 * * * * 18 11 23 16 17 12 20 26 </values> </instantiation>