| Name | Bacp/Bacp-m1/ Bacp-m1-05_c18.xml |
| MD5SUM | 57539414b171e46171fa8a7098eb6fd5 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 9 |
| Best CPU time to get the best result obtained on this benchmark | 3.89682 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 106 |
| Number of constraints | 36 |
| Number of domains | 7 |
| Minimum domain size | 2 |
| Maximum domain size | 10 |
| Distribution of domain sizes | [{"size":2,"count":80},{"size":5,"count":21},{"size":10,"count":5}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":1,"count":5},{"degree":2,"count":85},{"degree":6,"count":3},{"degree":7,"count":8},{"degree":8,"count":3},{"degree":9,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 17 |
| Distribution of constraint arities | [{"arity":2,"count":10},{"arity":6,"count":16},{"arity":17,"count":10}] |
| Number of extensional constraints | 16 |
| Number of intensional constraints | 10 |
| Distribution of constraint types | [{"type":"extension","count":16},{"type":"intension","count":10},{"type":"sum","count":5},{"type":"count","count":5}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297853 | OPT | 9 | 3.89682 | 1.02553 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4292175 | OPT | 9 | 8.00687 | 2.58937 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309209 | OPT | 9 | 8.26419 | 3.02648 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 9<instantiation> <list>prd[0] prd[1] prd[2] prd[3] prd[4] prd[5] prd[6] prd[7] prd[8] prd[9] prd[10] prd[11] prd[12] prd[13] prd[14] prd[15] nco[0] nco[1] nco[2] nco[3] nco[4] ncr[0] ncr[1] ncr[2] ncr[3] ncr[4] cp[0][0] cp[0][1] cp[0][2] cp[0][3] cp[0][4] cp[1][0] cp[1][1] cp[1][2] cp[1][3] cp[1][4] cp[2][0] cp[2][1] cp[2][2] cp[2][3] cp[2][4] cp[3][0] cp[3][1] cp[3][2] cp[3][3] cp[3][4] cp[4][0] cp[4][1] cp[4][2] cp[4][3] cp[4][4] cp[5][0] cp[5][1] cp[5][2] cp[5][3] cp[5][4] cp[6][0] cp[6][1] cp[6][2] cp[6][3] cp[6][4] cp[7][0] cp[7][1] cp[7][2] cp[7][3] cp[7][4] cp[8][0] cp[8][1] cp[8][2] cp[8][3] cp[8][4] cp[9][0] cp[9][1] cp[9][2] cp[9][3] cp[9][4] cp[10][0] cp[10][1] cp[10][2] cp[10][3] cp[10][4] cp[11][0] cp[11][1] cp[11][2] cp[11][3] cp[11][4] cp[12][0] cp[12][1] cp[12][2] cp[12][3] cp[12][4] cp[13][0] cp[13][1] cp[13][2] cp[13][3] cp[13][4] cp[14][0] cp[14][1] cp[14][2] cp[14][3] cp[14][4] cp[15][0] cp[15][1] cp[15][2] cp[15][3] cp[15][4] </list> <values>1 2 0 1 4 4 0 1 4 3 3 0 4 3 2 2 3 3 3 3 4 8 9 9 9 9 0 2 0 0 0 0 0 3 0 0 2 0 0 0 0 0 4 0 0 0 0 0 0 0 1 0 0 0 0 3 3 0 0 0 0 0 3 0 0 0 0 0 0 0 3 0 0 0 3 0 0 0 0 3 0 3 0 0 0 0 0 0 0 0 2 0 0 0 3 0 0 0 3 0 0 0 0 3 0 0 </values> </instantiation>