| Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-10.xml |
| MD5SUM | d4423909be1c89335e37f95235f61406 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 9 |
| Best CPU time to get the best result obtained on this benchmark | 245.98199 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 126 |
| Number of constraints | 125 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":2,"count":25},{"size":100,"count":101}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 25 |
| Distribution of variable degrees | [{"degree":2,"count":27},{"degree":3,"count":73},{"degree":4,"count":25},{"degree":25,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 100 |
| Distribution of constraint arities | [{"arity":2,"count":99},{"arity":3,"count":25},{"arity":100,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 124 |
| Distribution of constraint types | [{"type":"intension","count":124},{"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: 9<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] 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] 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] b[18] b[19] b[20] b[21] b[22] b[23] b[24] </list> <values>44 2 21 0 12 4 16 8 27 19 38 46 25 33 45 64 56 48 29 37 58 39 47 35 43 51 30 42 34 26 18 6 14 22 10 31 23 11 3 15 7 28 9 17 5 13 1 20 32 24 36 44 52 40 61 53 41 60 72 80 92 71 50 62 54 66 74 55 63 75 67 59 78 99 87 79 98 77 96 88 69 57 49 68 89 97 85 93 81 73 94 86 65 84 76 95 83 91 70 82 90 1 0 0 0 0 0 0 1 0 0 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 </values> </instantiation>