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