| Name | Bacp/Bacp-m2/ Bacp-m2-05_c18.xml |
| MD5SUM | 9bea89b95554517f61b3b27d7211ee0b |
| 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 | 0.025264 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 106 |
| Number of constraints | 116 |
| Number of domains | 4 |
| 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 | 8 |
| Distribution of variable degrees | [{"degree":1,"count":5},{"degree":2,"count":5},{"degree":4,"count":80},{"degree":5,"count":3},{"degree":6,"count":8},{"degree":7,"count":3},{"degree":8,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 17 |
| Distribution of constraint arities | [{"arity":2,"count":90},{"arity":5,"count":16},{"arity":17,"count":10}] |
| Number of extensional constraints | 80 |
| Number of intensional constraints | 10 |
| Distribution of constraint types | [{"type":"extension","count":80},{"type":"intension","count":10},{"type":"sum","count":26}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4300658 | OPT | 9 | 0.025264 | 0.02688 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300662 | OPT | 9 | 1.3507 | 0.593467 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300663 | SAT | 9 | 303.367 | 300.386 |
| GG's minicp 2018-04-29 (complete) | 4300659 | SAT (TO) | 9 | 2520.03 | 2490.21 |
| The dodo solver 2018-04-29 (complete) | 4300664 | SAT (TO) | 9 | 2520.06 | 2502.71 |
| MiniCPFever 2018-04-29 (complete) | 4300660 | SAT (TO) | 9 | 2520.07 | 2477.62 |
| slowpoke 2018-04-29 (incomplete) | 4300661 | SAT (TO) | 9 | 2520.1 | 2501.63 |
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 type='solution' cost='9'> <list>nco[0] nco[1] nco[2] nco[3] nco[4] ncr[0] ncr[1] ncr[2] ncr[3] ncr[4] pc[0][0] pc[0][10] pc[0][11] pc[0][12] pc[0][13] pc[0][14] pc[0][15] pc[0][1] pc[0][2] pc[0][3] pc[0][4] pc[0][5] pc[0][6] pc[0][7] pc[0][8] pc[0][9] pc[1][0] pc[1][10] pc[1][11] pc[1][12] pc[1][13] pc[1][14] pc[1][15] pc[1][1] pc[1][2] pc[1][3] pc[1][4] pc[1][5] pc[1][6] pc[1][7] pc[1][8] pc[1][9] pc[2][0] pc[2][10] pc[2][11] pc[2][12] pc[2][13] pc[2][14] pc[2][15] pc[2][1] pc[2][2] pc[2][3] pc[2][4] pc[2][5] pc[2][6] pc[2][7] pc[2][8] pc[2][9] pc[3][0] pc[3][10] pc[3][11] pc[3][12] pc[3][13] pc[3][14] pc[3][15] pc[3][1] pc[3][2] pc[3][3] pc[3][4] pc[3][5] pc[3][6] pc[3][7] pc[3][8] pc[3][9] pc[4][0] pc[4][10] pc[4][11] pc[4][12] pc[4][13] pc[4][14] pc[4][15] pc[4][1] pc[4][2] pc[4][3] pc[4][4] pc[4][5] pc[4][6] pc[4][7] pc[4][8] pc[4][9] prd[0] prd[10] prd[11] prd[12] prd[13] prd[14] prd[15] prd[1] prd[2] prd[3] prd[4] prd[5] prd[6] prd[7] prd[8] prd[9] </list> <values>3 3 4 3 3 9 9 9 9 8 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 4 1 0 0 1 3 3 2 2 0 2 2 3 1 4 4 </values> </instantiation>