| Name | PseudoBoolean-opt/ Pb-garden-7x7_c18.xml |
| MD5SUM | b012ef5fa7bba6c8b791df977729af7d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 12 |
| Best CPU time to get the best result obtained on this benchmark | 28.3557 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 49 |
| Number of constraints | 49 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":49}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":4,"count":4},{"degree":5,"count":20},{"degree":6,"count":25}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":3,"count":4},{"arity":4,"count":20},{"arity":5,"count":25}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":49}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Concrete 3.9.2-SuperNG (complete) | 4302744 | OPT | 12 | 28.3557 | 18.9567 |
| Sat4j-CSP 2018-07-11 (complete) | 4301355 | OPT | 12 | 41.6823 | 39.8447 |
| Mistral-2.0 2018-08-01 (complete) | 4312488 | OPT | 12 | 43.7286 | 43.7395 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301354 | OPT | 12 | 47.5326 | 43.5251 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312230 | OPT | 12 | 48.8962 | 47.4169 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310020 | SAT | 12 | 251.109 | 247.363 |
| cosoco 1.12 (complete) | 4301356 | SAT (TO) | 12 | 251.983 | 252.01 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310370 | SAT (TO) | 13 | 252.102 | 245.52 |
| Concrete 3.9.2 (complete) | 4302394 | SAT (TO) | 13 | 252.114 | 235.537 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 12<instantiation cost="12"> <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] </list> <values> 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 </values> </instantiation>