| Name | PseudoBoolean-opt/ Pb-garden-9x9_c18.xml |
| MD5SUM | cd5af6f5844e22b939db4ffe1efd4e73 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 20 |
| Best CPU time to get the best result obtained on this benchmark | 19431.1 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 81 |
| Number of constraints | 81 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":81}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":4,"count":4},{"degree":5,"count":28},{"degree":6,"count":49}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":3,"count":4},{"arity":4,"count":28},{"arity":5,"count":49}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":81}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297493 | SAT (TO) | 20 | 19431.1 | 2520.03 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291080 | SAT (TO) | 27 | 19935.9 | 2520.27 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308849 | SAT (TO) | 28 | 19917.8 | 2520.32 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 20<instantiation> <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] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] </list> <values>0 0 0 1 0 0 1 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 0 </values> </instantiation>