| Name | MultiKnapsack/MultiKnapsack-m1-gp/ MultiKnapsack-2-41.xml |
| MD5SUM | f335f4ada48cb5fc5845d54f24347b83 |
| 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.212835 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 27 |
| Number of constraints | 5 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":27}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":5,"count":27}] |
| Minimum constraint arity | 27 |
| Maximum constraint arity | 27 |
| Distribution of constraint arities | [{"arity":27,"count":5}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":5}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260175 | SAT | 0.212835 | 0.27811301 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251747 | SAT | 0.214238 | 0.214765 |
| cosoco-mini 1.12 (complete) | 4267356 | SAT | 0.215014 | 0.218464 |
| Naxos 1.1.0 (complete) | 4251748 | SAT | 1.08902 | 1.0898 |
| miniBTD 2017-08-10 (complete) | 4264915 | SAT | 37.450199 | 37.543201 |
| miniBTD 2017-06-30 (complete) | 4251746 | SAT | 37.5589 | 37.5651 |
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] x[20] x[21] x[22] x[23] x[24] x[25] x[26] </list> <values>1 1 0 1 0 0 1 0 1 1 1 0 0 1 0 1 0 1 0 1 0 1 1 1 1 1 1 </values> </instantiation>