| Name | Knapsack/ Knapsack-70-300-01_c18.xml |
| MD5SUM | 140f8f4c33ce7e414b2f0aa2389f8c03 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 1465 |
| Best CPU time to get the best result obtained on this benchmark | 248.995 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 70 |
| Number of constraints | 1 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":70}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":70}] |
| Minimum constraint arity | 70 |
| Maximum constraint arity | 70 |
| Distribution of constraint arities | [{"arity":70,"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 |
|---|---|---|---|---|---|
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312115 | SAT | 1465 | 248.995 | 247.36 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309905 | SAT | 1465 | 249.078 | 247.37 |
| Mistral-2.0 2018-08-01 (complete) | 4312712 | SAT (TO) | 1465 | 252.001 | 252.01 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310255 | SAT (TO) | 1465 | 252.07 | 247.226 |
| Concrete 3.9.2 (complete) | 4302279 | SAT (TO) | 1465 | 252.076 | 232.942 |
| Concrete 3.9.2-SuperNG (complete) | 4302629 | SAT (TO) | 1465 | 252.09 | 232.335 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302038 | SAT (TO) | 1406 | 252.112 | 245.916 |
| cosoco 1.12 (complete) | 4302040 | SAT (TO) | 1204 | 252.002 | 252.01 |
| Sat4j-CSP 2018-07-11 (complete) | 4302039 | ? (TO) | 252.093 | 250.516 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1465<instantiation> <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] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] </list> <values> 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 1 0 0 0 1 0 0 1 1 0 0 0 1 1 0 0 0 </values> </instantiation>