Name | Opd/Opd-sum-small/ Opd-11-011-005.xml |
MD5SUM | 7a6a01f2d694ae1725dbabce720210ef |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 2 |
Best CPU time to get the best result obtained on this benchmark | 1.31481 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 122 |
Number of constraints | 67 |
Number of domains | 2 |
Minimum domain size | 2 |
Maximum domain size | 10 |
Distribution of domain sizes | [{"size":2,"count":121},{"size":10,"count":1}] |
Minimum variable degree | 12 |
Maximum variable degree | 56 |
Distribution of variable degrees | [{"degree":12,"count":121},{"degree":56,"count":1}] |
Minimum constraint arity | 11 |
Maximum constraint arity | 121 |
Distribution of constraint arities | [{"arity":11,"count":11},{"arity":23,"count":55},{"arity":121,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"lex","count":1},{"type":"sum","count":66}] |
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: 2<instantiation> <list> z x[][] </list> <values> 2 0 0 0 0 0 0 1 1 1 1 1 0 0 0 1 1 1 0 0 0 1 1 0 0 1 0 1 1 0 1 1 0 0 0 1 0 1 0 1 1 0 1 0 0 0 1 1 0 1 0 1 0 0 0 1 0 1 1 1 0 0 0 1 0 1 0 1 0 0 1 1 0 1 1 0 0 0 1 0 1 0 0 1 1 0 0 1 0 1 0 1 1 0 0 0 0 1 0 1 1 1 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 0 0 1 1 0 </values> </instantiation>