Name | Knapsack/Knapsack-m1-s30/ Knapsack-30-100-08.xml |
MD5SUM | 050e295621c645d01420f9d2367ab908 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 1059 |
Best CPU time to get the best result obtained on this benchmark | 1.68953 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 30 |
Number of constraints | 1 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":30}] |
Minimum variable degree | 2 |
Maximum variable degree | 2 |
Distribution of variable degrees | [{"degree":2,"count":30}] |
Minimum constraint arity | 30 |
Maximum constraint arity | 30 |
Distribution of constraint arities | [{"arity":30,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":1}] |
Optimization problem | YES |
Type of objective | max SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 2.0 (complete) | 4397479 | OPT | 1059 | 1.68953 | 1.69018 |
cosoco 2 (complete) | 4394751 | OPT | 1059 | 1.7033 | 1.70398 |
cosoco 2.0 (complete) | 4408739 | OPT | 1059 | 1.70571 | 1.70626 |
(reference) PicatSAT 2019-09-12 (complete) | 4407713 | OPT | 1059 | 54.5634 | 54.562 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1059<instantiation type='solution' cost='1059'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 1 0 1 0 1 1 1 1 0 1 0 0 1 1 1 1 0 0 0 0 1 1 0 0 0 0 1 1 1 </values> </instantiation>