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