| Name | PeacableArmies/ PeacableArmies-m2-07_c18.xml |
| MD5SUM | d533abf730bec48b9e0ac1943d19d6b7 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 7 |
| Best CPU time to get the best result obtained on this benchmark | 2.86606 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 51 |
| Number of constraints | 479 |
| Number of domains | 2 |
| Minimum domain size | 3 |
| Maximum domain size | 24 |
| Distribution of domain sizes | [{"size":3,"count":49},{"size":24,"count":2}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 26 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":1},{"degree":20,"count":24},{"degree":22,"count":16},{"degree":24,"count":8},{"degree":26,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":2,"count":477},{"arity":50,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 477 |
| Distribution of constraint types | [{"type":"intension","count":477},{"type":"count","count":2}] |
| Optimization problem | YES |
| Type of objective | max VAR |
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> nw x[][] nb </list> <values> 7 2 0 2 0 0 0 2 0 0 0 0 1 0 0 0 0 0 0 0 0 2 0 1 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 2 0 2 0 0 0 2 7 </values> </instantiation>