| Name | MultiKnapsack/MultiKnapsack-m1-gp/ MultiKnapsack-1-03.xml |
| MD5SUM | 5764a69188b0fe12059f9d6ff06a642a |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.020135 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 20 |
| Number of constraints | 11 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":20}] |
| Minimum variable degree | 11 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":11,"count":20}] |
| Minimum constraint arity | 20 |
| Maximum constraint arity | 20 |
| Distribution of constraint arities | [{"arity":20,"count":11}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":11}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260171 | SAT | 0.020135 | 0.228787 |
| cosoco-mini 1.12 (complete) | 4267352 | SAT | 0.020398 | 0.020791 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251756 | SAT | 0.021589 | 0.0213239 |
| miniBTD 2017-06-30 (complete) | 4251755 | SAT | 0.088691 | 0.0900179 |
| miniBTD 2017-08-10 (complete) | 4264911 | SAT | 0.090297997 | 0.159988 |
| Naxos 1.1.0 (complete) | 4251757 | SAT | 0.175987 | 0.176702 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type='solution'> <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] </list> <values>1 0 0 0 0 0 0 0 0 1 0 0 0 1 1 1 1 1 1 1 </values> </instantiation>