| Name | Knapsack/ Knapsack-50-200-01_c18.xml |
| MD5SUM | f3af09ab16e693c32f4df19e0bf70cc2 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 1297 |
| Best CPU time to get the best result obtained on this benchmark | 28.6971 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 1 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":50}] |
| Minimum constraint arity | 50 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":50,"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) | 4312707 | OPT | 1297 | 6.18754 | 6.19026 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312111 | OPT | 1297 | 28.6971 | 27.4249 |
| cosoco 1.12 (complete) | 4302025 | OPT | 1297 | 84.436 | 84.457 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309901 | SAT | 1297 | 251.809 | 247.364 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302023 | SAT (TO) | 1297 | 252.062 | 247.036 |
| Concrete 3.9.2 (complete) | 4302275 | SAT (TO) | 1297 | 252.091 | 235.338 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310251 | SAT (TO) | 1297 | 252.097 | 246.426 |
| Concrete 3.9.2-SuperNG (complete) | 4302625 | SAT (TO) | 1297 | 252.136 | 234.734 |
| Sat4j-CSP 2018-07-11 (complete) | 4302024 | ? (TO) | 252.037 | 250.418 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1297<instantiation type="optimum" cost="1297"> <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] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] </list> <values> 0 0 0 1 1 1 0 1 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 1 1 1 1 1 0 1 0 0 0 0 0 0 0 0 0 0 1 1 </values> </instantiation>