| Name | Knapsack/ Knapsack-40-150-00_c18.xml |
| MD5SUM | c033178a1c92732c6616d8bd8ee8c714 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 932 |
| Best CPU time to get the best result obtained on this benchmark | 6.64032 |
| 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) | 4312714 | OPT | 932 | 3.4076 | 3.4092 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310248 | OPT | 932 | 6.64032 | 5.51522 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312108 | OPT | 932 | 7.7315 | 6.53953 |
| cosoco 1.12 (complete) | 4302046 | OPT | 932 | 27.0278 | 27.0297 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302044 | OPT | 932 | 82.7064 | 77.1972 |
| Concrete 3.9.2 (complete) | 4302272 | OPT | 932 | 140.147 | 125.137 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309898 | SAT | 932 | 251.374 | 247.361 |
| Concrete 3.9.2-SuperNG (complete) | 4302622 | SAT (TO) | 932 | 252.056 | 235.054 |
| Sat4j-CSP 2018-07-11 (complete) | 4302045 | SAT (TO) | 897 | 252.119 | 247.916 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 932<instantiation type="optimum" cost="932"> <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> 1 1 0 0 1 0 0 0 1 1 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 1 1 0 0 0 1 1 1 0 0 </values> </instantiation>