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