| Name | MultiKnapsack/MultiKnapsack-m1-gp/ MultiKnapsack-1-06.xml |
| MD5SUM | b8a831972e6e6770c8a4017652155aa1 |
| 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 | 18.9469 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 6 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":50}] |
| Minimum variable degree | 6 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":6,"count":50}] |
| Minimum constraint arity | 50 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":50,"count":6}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":6}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391814 | SAT | 18.9469 | 18.9619 |
| cosoco 2.0 (complete) | 4408554 | SAT | 29.9282 | 29.9303 |
| cosoco 2 (complete) | 4390014 | SAT | 30.0375 | 30.0398 |
| cosoco 2.0 (complete) | 4397294 | SAT | 34.3903 | 34.3893 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407555 | SAT | 123.101 | 123.126 |
| NACRE 1.0.5-Hybrid (complete) | 4391414 | SAT | 221.406 | 221.428 |
| NACRE 1.0.5 (complete) | 4391614 | SAT | 1567.38 | 1567.35 |
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] 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] </list> <values> 0 0 0 1 0 1 0 1 1 0 1 1 1 0 1 1 1 0 1 1 0 0 1 0 1 1 1 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 </values> </instantiation>