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