Name | Queens/ Queens-m1-s1/Queens-0200-m1.xml |
MD5SUM | aa794b13577ab4fe7ac8dae6d6ffdfc7 |
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 | 18.6139 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 200 |
Number of constraints | 19901 |
Number of domains | 1 |
Minimum domain size | 200 |
Maximum domain size | 200 |
Distribution of domain sizes | [{"size":200,"count":200}] |
Minimum variable degree | 200 |
Maximum variable degree | 200 |
Distribution of variable degrees | [{"degree":200,"count":200}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 200 |
Distribution of constraint arities | [{"arity":2,"count":19900},{"arity":200,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 19900 |
Distribution of constraint types | [{"type":"intension","count":19900},{"type":"allDifferent","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 id='sol1' type='solution'> <list> q[] </list> <values> 167 116 127 165 151 178 150 163 119 114 87 28 79 86 69 105 26 12 94 31 112 92 27 48 109 78 17 124 106 97 81 122 128 131 58 117 138 63 72 146 53 55 46 75 51 25 84 77 57 67 129 99 111 125 141 136 126 152 158 143 166 123 142 173 168 174 183 189 162 172 184 190 188 193 195 187 164 170 186 82 179 182 171 120 22 96 169 134 43 108 118 107 113 101 52 155 32 50 38 36 45 21 5 37 54 191 121 103 160 39 175 177 181 133 24 42 9 2 23 161 159 196 180 197 185 14 49 10 16 44 41 35 40 47 15 199 93 194 4 85 56 18 83 0 100 74 65 59 6 71 156 64 76 70 144 80 95 29 7 3 88 8 137 13 73 135 33 115 110 104 30 139 98 34 19 148 1 11 130 66 62 147 145 132 102 91 140 149 89 68 154 61 157 90 153 176 198 20 60 192 </values> </instantiation>