| Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-06.xml |
| MD5SUM | 315e274f87a0401bb6a43b890592ba0e |
| 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 | 18.0875 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 48 |
| Number of constraints | 47 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 36 |
| Distribution of domain sizes | [{"size":2,"count":11},{"size":36,"count":37}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":2,"count":13},{"degree":3,"count":23},{"degree":4,"count":11},{"degree":11,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":2,"count":35},{"arity":3,"count":11},{"arity":36,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 46 |
| Distribution of constraint types | [{"type":"intension","count":46},{"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 type='solution' cost='0'> <list>b[0] b[10] b[1] b[2] b[3] b[4] b[5] b[6] b[7] b[8] b[9] q x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[30] x[31] x[32] x[33] x[34] x[35] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 0 0 0 0 0 0 0 0 0 0 20 6 22 35 27 31 18 26 30 19 32 28 2 17 9 5 16 29 33 25 21 34 23 13 10 14 1 12 20 24 0 8 4 15 7 3 11 </values> </instantiation>