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