| Name | KnightTour/KnightTour-ext-s1/ KnightTour-08-ext03.xml |
| MD5SUM | 8a5157f08f2f2e597251b23721b8eb7d |
| 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 | 2.53772 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 34 |
| Number of domains | 1 |
| Minimum domain size | 64 |
| Maximum domain size | 64 |
| Distribution of domain sizes | [{"size":64,"count":64}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":62},{"degree":3,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":2,"count":1},{"arity":3,"count":32},{"arity":64,"count":1}] |
| Number of extensional constraints | 32 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":32},{"type":"allDifferent","count":1},{"type":"instantiation","count":1}] |
| 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>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] </list> <values>0 10 4 19 2 12 6 21 11 26 9 3 13 7 22 5 15 30 20 35 25 8 18 1 16 33 27 37 31 14 29 23 38 28 34 24 41 56 50 40 57 51 36 46 63 53 47 62 52 42 48 58 43 60 54 39 45 55 61 44 59 49 32 17 </values> </instantiation>