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