| Name | Opd/Opd-sum-small/ Opd-19-019-009.xml |
| MD5SUM | 3c310f791b76d42f8a4a60c7feb2193f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 5 |
| Best CPU time to get the best result obtained on this benchmark | 242.12801 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 362 |
| Number of constraints | 191 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":2,"count":361},{"size":16,"count":1}] |
| Minimum variable degree | 20 |
| Maximum variable degree | 172 |
| Distribution of variable degrees | [{"degree":20,"count":361},{"degree":172,"count":1}] |
| Minimum constraint arity | 19 |
| Maximum constraint arity | 361 |
| Distribution of constraint arities | [{"arity":19,"count":19},{"arity":39,"count":171},{"arity":361,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"lex","count":1},{"type":"sum","count":190}] |
| Optimization problem | YES |
| Type of objective | min VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 5<instantiation id='sol5' type='solution' cost='5'> <list> z x[][] </list> <values> 5 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 1 0 0 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 1 0 0 0 0 1 1 0 1 0 1 1 1 0 1 0 1 0 0 1 0 0 0 1 0 1 1 1 1 0 0 1 1 0 1 0 0 1 0 0 0 1 0 0 0 0 1 1 1 1 1 1 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 1 1 0 1 1 1 0 0 0 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 0 1 1 0 1 1 1 0 1 0 0 0 1 0 0 0 1 1 0 0 1 1 1 0 0 1 0 1 1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 0 1 1 0 0 0 0 1 1 0 1 0 1 0 0 1 1 1 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 0 1 1 1 1 1 0 1 1 0 0 0 0 0 1 1 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 1 1 1 1 1 0 1 0 0 0 1 1 0 1 0 0 0 0 1 0 1 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 1 1 1 0 1 0 1 1 1 0 0 1 1 1 1 0 0 0 0 0 1 1 1 0 1 0 0 0 0 1 </values> </instantiation>