| Name | KnightTour/KnightTour-ext-s1/ KnightTour-12-ext04.xml |
| MD5SUM | 7a2ffbd3a2fba29c29472d7427b18f31 |
| 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 | 46.9245 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 144 |
| Number of constraints | 50 |
| Number of domains | 1 |
| Minimum domain size | 144 |
| Maximum domain size | 144 |
| Distribution of domain sizes | [{"size":144,"count":144}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":142},{"degree":3,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 144 |
| Distribution of constraint arities | [{"arity":2,"count":1},{"arity":4,"count":48},{"arity":144,"count":1}] |
| Number of extensional constraints | 48 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":48},{"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] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[110] x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128] x[129] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[140] x[141] x[142] x[143] </list> <values>0 14 24 1 15 5 19 9 23 33 10 20 30 40 54 68 43 53 67 77 91 101 111 121 135 112 122 132 109 99 85 108 133 123 137 127 117 142 119 129 143 118 104 114 100 90 76 66 89 79 102 92 78 88 98 84 61 75 65 55 45 35 58 44 34 11 21 31 41 64 74 60 50 36 13 3 17 7 32 22 8 18 4 27 37 51 28 38 48 62 52 42 56 46 69 59 82 57 47 70 80 94 71 81 95 105 115 125 139 116 141 131 106 83 93 107 130 140 126 136 113 103 128 138 124 134 120 110 96 86 72 97 87 73 63 49 39 29 6 16 26 12 2 25 </values> </instantiation>