| Name | Knapsack/ Knapsack-40-150-01_c18.xml |
| MD5SUM | 8d3b063d869bbc1321103d2dddf1736e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 1128 |
| Best CPU time to get the best result obtained on this benchmark | 4.0899 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 1 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":40}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":40}] |
| Minimum constraint arity | 40 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":40,"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 |
|---|---|---|---|---|---|
| Mistral-2.0 2018-08-01 (complete) | 4312713 | OPT | 1128 | 1.90035 | 1.90161 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310249 | OPT | 1128 | 4.0899 | 2.97987 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312109 | OPT | 1128 | 4.28932 | 3.01309 |
| cosoco 1.12 (complete) | 4302043 | OPT | 1128 | 19.0923 | 19.0934 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302041 | OPT | 1128 | 38.8655 | 34.52 |
| Concrete 3.9.2 (complete) | 4302273 | OPT | 1128 | 86.6647 | 71.549 |
| Concrete 3.9.2-SuperNG (complete) | 4302623 | OPT | 1128 | 117.04 | 100.767 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309899 | SAT | 1128 | 251.718 | 247.362 |
| Sat4j-CSP 2018-07-11 (complete) | 4302042 | SAT (TO) | 1110 | 252.167 | 248.524 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1128<instantiation type="optimum" cost="1128"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] </list> <values> 0 1 1 0 0 1 0 1 1 0 1 0 1 1 1 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 1 1 0 0 1 </values> </instantiation>