| Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-07.xml |
| MD5SUM | 7aff4fe352a8c3fb8c4e8479cd8d4369 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 0 |
| Best CPU time to get the best result obtained on this benchmark | 44.8839 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 65 |
| Number of constraints | 64 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 49 |
| Distribution of domain sizes | [{"size":2,"count":15},{"size":49,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 15 |
| Distribution of variable degrees | [{"degree":2,"count":17},{"degree":3,"count":32},{"degree":4,"count":15},{"degree":15,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 49 |
| Distribution of constraint arities | [{"arity":2,"count":48},{"arity":3,"count":15},{"arity":49,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 63 |
| Distribution of constraint types | [{"type":"intension","count":63},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 0<instantiation> <list>q 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] b[0] b[1] b[2] b[3] b[4] b[5] b[6] b[7] b[8] b[9] b[10] b[11] b[12] b[13] b[14] </list> <values>18 6 11 24 19 32 47 34 39 48 33 46 41 26 31 44 35 30 21 36 45 40 27 12 3 8 17 22 37 42 29 14 23 28 43 38 25 20 5 10 1 16 7 2 15 0 9 4 13 18 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>