Name | PseudoBoolean/PseudoBoolean-opt-dimacs/ Pb-ii32a1.xml |
MD5SUM | f79f0460403e66f3200e441fc7b1c413 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 444 |
Best CPU time to get the best result obtained on this benchmark | 76.0369 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 918 |
Number of constraints | 9671 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":918}] |
Minimum variable degree | 3 |
Maximum variable degree | 110 |
Distribution of variable degrees | [{"degree":3,"count":267},{"degree":27,"count":3},{"degree":31,"count":3},{"degree":32,"count":3},{"degree":34,"count":267},{"degree":35,"count":3},{"degree":38,"count":6},{"degree":40,"count":3},{"degree":41,"count":12},{"degree":42,"count":9},{"degree":43,"count":9},{"degree":44,"count":15},{"degree":45,"count":15},{"degree":46,"count":6},{"degree":47,"count":9},{"degree":48,"count":9},{"degree":49,"count":6},{"degree":50,"count":15},{"degree":51,"count":15},{"degree":52,"count":9},{"degree":53,"count":9},{"degree":54,"count":12},{"degree":55,"count":6},{"degree":57,"count":6},{"degree":58,"count":6},"...",{"degree":69,"count":3}, {"degree":71,"count":6}, {"degree":72,"count":9}, {"degree":74,"count":3}, {"degree":75,"count":6}, {"degree":77,"count":12}, {"degree":78,"count":12}, {"degree":79,"count":9}, {"degree":80,"count":6}, {"degree":81,"count":6}, {"degree":82,"count":12}, {"degree":83,"count":12}, {"degree":84,"count":6}, {"degree":85,"count":6}, {"degree":86,"count":9}, {"degree":87,"count":12}, {"degree":88,"count":12}, {"degree":90,"count":6}, {"degree":91,"count":3}, {"degree":93,"count":9}, {"degree":94,"count":6}, {"degree":96,"count":3}, {"degree":101,"count":3}, {"degree":107,"count":6}, {"degree":110,"count":3}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 32 |
Distribution of constraint arities | [{"arity":2,"count":9099},{"arity":3,"count":89},{"arity":32,"count":483}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":9671}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
(reference) PicatSAT 2019-09-12 (complete) | 4407773 | OPT | 444 | 76.0369 | 76.0356 |
cosoco 2 (complete) | 4394777 | SAT (TO) | 444 | 2400.02 | 2399.9 |
cosoco 2.0 (complete) | 4408765 | SAT (TO) | 444 | 2400.04 | 2400.11 |
cosoco 2.0 (complete) | 4397505 | SAT (TO) | 444 | 2400.09 | 2400.2 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 444<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 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 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 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 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 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 0 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 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 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 1 0 0 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 0 0 0 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 0 0 1 0 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 0 0 0 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 0 1 0 1 0 1 0 1 1 0 1 0 0 0 0 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 0 1 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 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 0 1 1 0 0 1 0 1 0 1 1 0 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 0 1 0 0 1 0 1 1 0 0 1 0 1 0 0 1 0 0 1 0 1 1 0 1 0 0 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 1 0 0 0 0 1 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 0 1 1 0 0 1 1 0 0 1 0 1 0 0 1 0 0 1 0 1 1 0 1 0 0 0 0 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 </values> </instantiation>