| Name | Knapsack/ Knapsack-30-100-01_c18.xml |
| MD5SUM | 29cb88997fb73697c0a266537888e139 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 871 |
| Best CPU time to get the best result obtained on this benchmark | 0.462396 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 1 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":30}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":30}] |
| Minimum constraint arity | 30 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":30,"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 |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4300007 | OPT | 871 | 0.462396 | 0.464057 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300011 | OPT | 871 | 1.05009 | 0.532699 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300012 | SAT | 871 | 302.045 | 300.281 |
| slowpoke 2018-04-29 (incomplete) | 4300010 | SAT (TO) | 871 | 2520.03 | 2511.71 |
| The dodo solver 2018-04-29 (complete) | 4300013 | SAT (TO) | 871 | 2520.09 | 2513.12 |
| GG's minicp 2018-04-29 (complete) | 4300008 | SAT (TO) | 871 | 2520.11 | 2514.91 |
| MiniCPFever 2018-04-29 (complete) | 4300009 | SAT (TO) | 871 | 2521.47 | 2273.58 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 871<instantiation type='solution' cost='871'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 0 0 1 0 1 0 1 0 0 1 1 1 0 1 0 </values> </instantiation>