| Name | PseudoBoolean/PseudoBoolean-opt-dimacs/ Pb-ii32e3.xml |
| MD5SUM | bcb3f3ceeead4664bdf41fd123f1defa |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 310 |
| Best CPU time to get the best result obtained on this benchmark | 91.9577 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 660 |
| Number of constraints | 5350 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":660}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 107 |
| Distribution of variable degrees | [{"degree":3,"count":138},{"degree":12,"count":3},{"degree":13,"count":3},{"degree":14,"count":3},{"degree":15,"count":3},{"degree":16,"count":3},{"degree":18,"count":3},{"degree":19,"count":3},{"degree":20,"count":6},{"degree":21,"count":15},{"degree":22,"count":3},{"degree":23,"count":9},{"degree":24,"count":30},{"degree":25,"count":3},{"degree":26,"count":18},{"degree":27,"count":3},{"degree":28,"count":30},{"degree":29,"count":9},{"degree":30,"count":3},{"degree":31,"count":15},{"degree":32,"count":6},{"degree":33,"count":3},{"degree":34,"count":141},{"degree":36,"count":3},{"degree":37,"count":3},"...",{"degree":71,"count":3}, {"degree":72,"count":3}, {"degree":73,"count":6}, {"degree":74,"count":12}, {"degree":75,"count":6}, {"degree":76,"count":3}, {"degree":77,"count":12}, {"degree":78,"count":18}, {"degree":79,"count":12}, {"degree":80,"count":18}, {"degree":81,"count":12}, {"degree":82,"count":3}, {"degree":83,"count":6}, {"degree":84,"count":12}, {"degree":85,"count":6}, {"degree":86,"count":3}, {"degree":87,"count":3}, {"degree":89,"count":3}, {"degree":91,"count":3}, {"degree":92,"count":6}, {"degree":93,"count":3}, {"degree":94,"count":3}, {"degree":95,"count":3}, {"degree":96,"count":3}, {"degree":107,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 32 |
| Distribution of constraint arities | [{"arity":2,"count":4842},{"arity":3,"count":46},{"arity":32,"count":462}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":5350}] |
| 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: 310<instantiation> <list> x[] </list> <values> 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 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 0 1 1 0 1 0 1 0 0 0 0 1 1 0 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 1 1 0 0 0 1 0 0 1 1 0 0 1 1 0 1 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 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 1 0 1 0 1 0 1 0 1 0 1 0 0 1 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 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 0 1 0 1 1 0 0 1 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 0 0 1 1 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 0 1 0 1 1 0 1 0 0 1 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 1 0 0 1 0 1 1 0 1 0 0 1 0 1 0 1 0 1 1 0 0 0 0 1 1 0 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 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 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 0 1 0 0 1 0 1 1 0 0 1 0 1 0 0 0 1 1 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 </values> </instantiation>