| Name | Knapsack/ Knapsack-60-250-01_c18.xml |
| MD5SUM | 572d51936cbf7dcb36f92bd653feb000 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 1323 |
| Best CPU time to get the best result obtained on this benchmark | 248.906 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 1 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":60}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":60}] |
| Minimum constraint arity | 60 |
| Maximum constraint arity | 60 |
| Distribution of constraint arities | [{"arity":60,"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) | 4312708 | OPT | 1323 | 157.546 | 157.55 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312113 | SAT | 1323 | 248.906 | 247.362 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309903 | SAT | 1323 | 248.94 | 247.363 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310253 | SAT (TO) | 1323 | 252.049 | 245.218 |
| Concrete 3.9.2 (complete) | 4302277 | SAT (TO) | 1323 | 252.086 | 234.836 |
| Concrete 3.9.2-SuperNG (complete) | 4302627 | SAT (TO) | 1323 | 252.107 | 233.533 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302026 | SAT (TO) | 1313 | 252.058 | 246.318 |
| cosoco 1.12 (complete) | 4302028 | SAT (TO) | 1237 | 251.957 | 252.01 |
| Sat4j-CSP 2018-07-11 (complete) | 4302027 | ? (TO) | 252.042 | 250.817 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1323<instantiation type="optimum" cost="1323"> <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] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] </list> <values> 0 1 0 1 0 1 1 0 0 1 1 0 0 0 0 1 1 0 1 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 0 1 </values> </instantiation>