| Name | GracefulGraph/ GracefulGraph-K05-P02_c18.xml |
| MD5SUM | 803795f7a37fd3a40686e408980b1bff |
| 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 | 21.8959 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 65 |
| 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":10}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":30},{"degree":2,"count":25},{"degree":6,"count":10}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":3,"count":25},{"arity":10,"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> <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] ce[0][0][1] ce[0][0][2] ce[0][0][3] ce[0][0][4] ce[0][1][2] ce[0][1][3] ce[0][1][4] ce[0][2][3] ce[0][2][4] ce[0][3][4] ce[1][0][1] ce[1][0][2] ce[1][0][3] ce[1][0][4] ce[1][1][2] ce[1][1][3] ce[1][1][4] ce[1][2][3] ce[1][2][4] ce[1][3][4] cie[0][0] cie[0][1] cie[0][2] cie[0][3] cie[0][4] </list> <values> 25 0 19 18 4 1 23 3 6 14 25 6 7 21 19 18 4 1 15 14 22 2 5 13 20 17 9 3 11 8 24 23 16 12 10 </values> </instantiation>