Name | PseudoBoolean-opt/ Pb-garden-15x15_c18.xml |
MD5SUM | 3febb05d57a4106fdf30b8e2d6c3cfc0 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 53 |
Best CPU time to get the best result obtained on this benchmark | 1136.33 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 225 |
Number of constraints | 225 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":225}] |
Minimum variable degree | 4 |
Maximum variable degree | 6 |
Distribution of variable degrees | [{"degree":4,"count":4},{"degree":5,"count":52},{"degree":6,"count":169}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 5 |
Distribution of constraint arities | [{"arity":3,"count":4},{"arity":4,"count":52},{"arity":5,"count":169}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":225}] |
Optimization problem | YES |
Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 53<instantiation> <list> x[] </list> <values> 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 1 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 1 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 </values> </instantiation>