| Name | PseudoBoolean/PseudoBoolean-opt-dimacs/ Pb-ii32b3.xml |
| MD5SUM | c1d081b79f1c10e41665328fecc5a7d0 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 331 |
| Best CPU time to get the best result obtained on this benchmark | 119.032 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 696 |
| Number of constraints | 6082 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":696}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 119 |
| Distribution of variable degrees | [{"degree":3,"count":156},{"degree":14,"count":3},{"degree":15,"count":3},{"degree":16,"count":3},{"degree":18,"count":3},{"degree":21,"count":6},{"degree":22,"count":6},{"degree":23,"count":15},{"degree":24,"count":9},{"degree":25,"count":6},{"degree":26,"count":6},{"degree":27,"count":6},{"degree":28,"count":21},{"degree":29,"count":18},{"degree":30,"count":21},{"degree":31,"count":6},{"degree":32,"count":6},{"degree":33,"count":6},{"degree":34,"count":165},{"degree":35,"count":15},{"degree":36,"count":6},{"degree":37,"count":6},{"degree":40,"count":3},{"degree":42,"count":3},{"degree":43,"count":3},"...",{"degree":86,"count":3}, {"degree":88,"count":3}, {"degree":91,"count":3}, {"degree":92,"count":6}, {"degree":93,"count":3}, {"degree":94,"count":6}, {"degree":95,"count":6}, {"degree":96,"count":21}, {"degree":97,"count":6}, {"degree":99,"count":15}, {"degree":100,"count":12}, {"degree":101,"count":6}, {"degree":102,"count":12}, {"degree":103,"count":15}, {"degree":105,"count":6}, {"degree":106,"count":21}, {"degree":107,"count":6}, {"degree":108,"count":6}, {"degree":109,"count":3}, {"degree":110,"count":6}, {"degree":111,"count":3}, {"degree":114,"count":3}, {"degree":116,"count":3}, {"degree":118,"count":6}, {"degree":119,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 32 |
| Distribution of constraint arities | [{"arity":2,"count":5436},{"arity":3,"count":52},{"arity":32,"count":594}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":6082}] |
| 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: 331<instantiation> <list> x[] </list> <values> 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 0 0 1 1 0 0 1 1 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 0 1 0 1 1 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 0 0 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 0 1 0 1 1 0 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 0 0 0 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 0 0 1 0 1 0 1 1 0 0 1 </values> </instantiation>