Name | PseudoBoolean/PseudoBoolean-opt-dimacs/ Pb-ii32e5.xml |
MD5SUM | 09b37649e722f1a7e8efbcfa22777a90 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 503 |
Best CPU time to get the best result obtained on this benchmark | 226.188 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 1044 |
Number of constraints | 12158 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":1044}] |
Minimum variable degree | 3 |
Maximum variable degree | 182 |
Distribution of variable degrees | [{"degree":3,"count":330},{"degree":25,"count":3},{"degree":30,"count":3},{"degree":32,"count":3},{"degree":34,"count":333},{"degree":43,"count":3},{"degree":46,"count":6},{"degree":48,"count":3},{"degree":50,"count":3},{"degree":52,"count":15},{"degree":53,"count":9},{"degree":54,"count":9},{"degree":55,"count":12},{"degree":56,"count":6},{"degree":57,"count":18},{"degree":59,"count":18},{"degree":60,"count":6},{"degree":61,"count":12},{"degree":62,"count":9},{"degree":63,"count":9},{"degree":64,"count":15},{"degree":66,"count":3},{"degree":68,"count":3},{"degree":70,"count":6},{"degree":73,"count":3},"...",{"degree":140,"count":9}, {"degree":142,"count":3}, {"degree":143,"count":3}, {"degree":144,"count":12}, {"degree":145,"count":12}, {"degree":146,"count":3}, {"degree":147,"count":12}, {"degree":148,"count":3}, {"degree":149,"count":12}, {"degree":150,"count":12}, {"degree":151,"count":3}, {"degree":152,"count":3}, {"degree":154,"count":9}, {"degree":155,"count":3}, {"degree":156,"count":9}, {"degree":157,"count":6}, {"degree":158,"count":3}, {"degree":159,"count":3}, {"degree":160,"count":3}, {"degree":163,"count":6}, {"degree":165,"count":3}, {"degree":166,"count":3}, {"degree":172,"count":3}, {"degree":175,"count":3}, {"degree":182,"count":3}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 32 |
Distribution of constraint arities | [{"arity":2,"count":11178},{"arity":3,"count":110},{"arity":32,"count":870}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":12158}] |
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) | 4407771 | OPT | 503 | 226.188 | 226.191 |
cosoco 2.0 (complete) | 4408842 | SAT (TO) | 503 | 2400.03 | 2400.01 |
cosoco 2.0 (complete) | 4397582 | SAT (TO) | 503 | 2400.04 | 2400.11 |
cosoco 2 (complete) | 4394775 | SAT (TO) | 503 | 2400.06 | 2399.9 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 503<instantiation> <list> x[] </list> <values> 1 0 1 0 0 1 1 0 1 0 1 0 1 0 0 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 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 0 1 0 0 1 0 0 1 0 1 0 1 0 0 0 1 0 1 0 0 1 1 0 0 0 1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 1 1 0 1 0 1 0 0 0 1 0 1 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 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 0 1 0 1 1 0 0 1 1 0 0 1 0 1 0 1 1 0 0 1 1 0 0 0 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 0 1 1 0 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 1 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 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 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 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 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 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 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 0 0 1 1 0 0 1 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 0 0 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 1 0 0 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 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 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 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 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 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 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 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 </values> </instantiation>