Name | PseudoBoolean/PseudoBoolean-opt-dimacs/ Pb-jnh217.xml |
MD5SUM | 22080d50f9445b142e794791d56d4fc4 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 89 |
Best CPU time to get the best result obtained on this benchmark | 28.8302 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 200 |
Number of constraints | 900 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":200}] |
Minimum variable degree | 11 |
Maximum variable degree | 33 |
Distribution of variable degrees | [{"degree":11,"count":1},{"degree":12,"count":2},{"degree":13,"count":4},{"degree":14,"count":4},{"degree":15,"count":3},{"degree":16,"count":7},{"degree":17,"count":8},{"degree":18,"count":16},{"degree":19,"count":19},{"degree":20,"count":15},{"degree":21,"count":24},{"degree":22,"count":17},{"degree":23,"count":12},{"degree":24,"count":18},{"degree":25,"count":13},{"degree":26,"count":10},{"degree":27,"count":7},{"degree":28,"count":5},{"degree":29,"count":6},{"degree":30,"count":3},{"degree":31,"count":4},{"degree":33,"count":2}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 11 |
Distribution of constraint arities | [{"arity":2,"count":148},{"arity":3,"count":151},{"arity":4,"count":192},{"arity":5,"count":151},{"arity":6,"count":92},{"arity":7,"count":74},{"arity":8,"count":49},{"arity":9,"count":29},{"arity":10,"count":10},{"arity":11,"count":4}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":900}] |
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) | 4407775 | OPT | 89 | 28.8302 | 28.8323 |
cosoco 2 (complete) | 4394779 | OPT | 89 | 55.8364 | 55.8335 |
cosoco 2.0 (complete) | 4408710 | OPT | 89 | 55.9905 | 55.9979 |
cosoco 2.0 (complete) | 4397450 | OPT | 89 | 56.8835 | 56.8859 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 89<instantiation> <list> x[] </list> <values> 0 1 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 0 1 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 0 0 0 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 0 0 1 1 0 0 1 1 0 1 0 0 0 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 0 1 0 0 1 0 1 1 0 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 0 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 </values> </instantiation>