| Name | PeacableArmies/ PeacableArmies-m1-05_c18.xml |
| MD5SUM | 4b3a1ce7a352f102282a9a722b8ddb17 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 4 |
| Best CPU time to get the best result obtained on this benchmark | 0.192942 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 346 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":50}] |
| Minimum variable degree | 14 |
| Maximum variable degree | 19 |
| Distribution of variable degrees | [{"degree":14,"count":16},{"degree":15,"count":16},{"degree":16,"count":8},{"degree":17,"count":8},{"degree":18,"count":1},{"degree":19,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":2,"count":345},{"arity":50,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 345 |
| Distribution of constraint types | [{"type":"intension","count":345},{"type":"sum","count":1}] |
| Optimization problem | YES |
| Type of objective | max SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 4<instantiation> <list> b[][] w[][] </list> <values> 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 </values> </instantiation>