| Name | Knapsack/Knapsack-m1-s60/ Knapsack-60-250-17.xml |
| MD5SUM | 55160ca1cb6892c8520106891d7cdd01 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 1152 |
| Best CPU time to get the best result obtained on this benchmark | 2400.03 |
| 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 |
|---|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259895 | SAT (TO) | 1152 | 2400.03 | 2400 |
| cosoco-mini 1.12 (complete) | 4267076 | SAT (TO) | 1152 | 2400.1001 | 2399.8 |
| Naxos 1.1.0 (complete) | 4253117 | SAT (TO) | 1062 | 2400.02 | 2399.7 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253116 | ? (TO) | 2400.06 | 2400.21 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1152<instantiation type='solution' cost='1152'> <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[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[3] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[4] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[5] x[6] x[7] x[8] x[9] </list> <values>0 1 0 1 0 0 0 1 0 0 0 1 0 0 1 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 1 0 </values> </instantiation>