| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K03-P07.xml |
| MD5SUM | da29a6dd83857351367aad9031227a75 |
| 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 | 5.04114 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 102 |
| Number of constraints | 41 |
| Number of domains | 2 |
| Minimum domain size | 39 |
| Maximum domain size | 40 |
| Distribution of domain sizes | [{"size":39,"count":39},{"size":40,"count":21}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":0,"count":42},{"degree":2,"count":39},{"degree":4,"count":6},{"degree":5,"count":15}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 39 |
| Distribution of constraint arities | [{"arity":3,"count":39},{"arity":21,"count":1},{"arity":39,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 39 |
| Distribution of constraint types | [{"type":"intension","count":39},{"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[1][0] cn[1][1] cn[1][2] cn[2][0] cn[2][1] cn[2][2] cn[3][0] cn[3][1] cn[3][2] cn[4][0] cn[4][1] cn[4][2] cn[5][0] cn[5][1] cn[5][2] cn[6][0] cn[6][1] cn[6][2] ce[0][0][0] ce[0][0][1] ce[0][0][2] ce[0][1][0] ce[0][1][1] ce[0][1][2] ce[0][2][0] ce[0][2][1] ce[0][2][2] ce[1][0][0] ce[1][0][1] ce[1][0][2] ce[1][1][0] ce[1][1][1] ce[1][1][2] ce[1][2][0] ce[1][2][1] ce[1][2][2] ce[2][0][0] ce[2][0][1] ce[2][0][2] ce[2][1][0] ce[2][1][1] ce[2][1][2] ce[2][2][0] ce[2][2][1] ce[2][2][2] ce[3][0][0] ce[3][0][1] ce[3][0][2] ce[3][1][0] ce[3][1][1] ce[3][1][2] ce[3][2][0] ce[3][2][1] ce[3][2][2] ce[4][0][0] ce[4][0][1] ce[4][0][2] ce[4][1][0] ce[4][1][1] ce[4][1][2] ce[4][2][0] ce[4][2][1] ce[4][2][2] ce[5][0][0] ce[5][0][1] ce[5][0][2] ce[5][1][0] ce[5][1][1] ce[5][1][2] ce[5][2][0] ce[5][2][1] ce[5][2][2] ce[6][0][0] ce[6][0][1] ce[6][0][2] ce[6][1][0] ce[6][1][1] ce[6][1][2] ce[6][2][0] ce[6][2][1] ce[6][2][2] cie[0][0] cie[0][1] cie[0][2] cie[1][0] cie[1][1] cie[1][2] cie[2][0] cie[2][1] cie[2][2] cie[3][0] cie[3][1] cie[3][2] cie[4][0] cie[4][1] cie[4][2] cie[5][0] cie[5][1] cie[5][2] </list> <values>9 33 28 35 3 12 4 38 16 25 5 19 0 18 17 39 29 2 1 37 30 * 24 19 * * 5 * * * * 32 23 * * 9 * * * * 34 12 * * 22 * * * * 20 6 * * 14 * * * * 18 17 * * 1 * * * * 10 37 * * 27 * * * * 36 29 * * 7 * * * 26 30 16 31 35 4 21 33 3 25 13 2 39 11 15 38 8 28 </values> </instantiation>