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