| Name | PeacableArmies/ PeacableArmies-m1-07_c18.xml |
| MD5SUM | 93689e7972bcd89c8c0248fcf1fc8ef9 |
| 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 | 22.666 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 98 |
| Number of constraints | 1002 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":98}] |
| Minimum variable degree | 20 |
| Maximum variable degree | 27 |
| Distribution of variable degrees | [{"degree":20,"count":24},{"degree":21,"count":24},{"degree":22,"count":16},{"degree":23,"count":16},{"degree":24,"count":8},{"degree":25,"count":8},{"degree":26,"count":1},{"degree":27,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 98 |
| Distribution of constraint arities | [{"arity":2,"count":1001},{"arity":98,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1001 |
| Distribution of constraint types | [{"type":"intension","count":1001},{"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: 7<instantiation> <list> b[][] w[][] </list> <values> 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 </values> </instantiation>