| Name | Bacp/Bacp-m1/ Bacp-m1-06_c18.xml |
| MD5SUM | 32277e0a94b1ff1bbbf238d8a7ce34be |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 10 |
| Best CPU time to get the best result obtained on this benchmark | 6.66674 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 152 |
| Number of constraints | 46 |
| Number of domains | 8 |
| Minimum domain size | 2 |
| Maximum domain size | 10 |
| Distribution of domain sizes | [{"size":2,"count":120},{"size":5,"count":6},{"size":6,"count":20},{"size":10,"count":6}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":1,"count":6},{"degree":2,"count":126},{"degree":7,"count":2},{"degree":8,"count":11},{"degree":9,"count":4},{"degree":10,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":2,"count":14},{"arity":7,"count":20},{"arity":21,"count":12}] |
| Number of extensional constraints | 20 |
| Number of intensional constraints | 14 |
| Distribution of constraint types | [{"type":"extension","count":20},{"type":"intension","count":14},{"type":"sum","count":6},{"type":"count","count":6}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Mistral-2.0 2018-08-01 (complete) | 4312784 | OPT | 10 | 1.95686 | 1.95763 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312365 | OPT | 10 | 6.66674 | 3.28701 |
| Sat4j-CSP 2018-07-11 (complete) | 4302255 | OPT | 10 | 9.51376 | 7.20689 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302254 | OPT | 10 | 10.0192 | 7.1887 |
| Concrete 3.9.2-SuperNG (complete) | 4302879 | OPT | 10 | 28.117 | 18.9431 |
| Concrete 3.9.2 (complete) | 4302529 | OPT | 10 | 29.5174 | 19.016 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310155 | SAT (TO) | 10 | 252.063 | 245.026 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310505 | SAT (TO) | 10 | 252.091 | 243.429 |
| cosoco 1.12 (complete) | 4302256 | Signal | 0.011444 | 0.705747 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 10<instantiation type="optimum" cost="10"> <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] prd[16] prd[17] prd[18] prd[19] nco[0] nco[1] nco[2] nco[3] nco[4] nco[5] ncr[0] ncr[1] ncr[2] ncr[3] ncr[4] ncr[5] cp[0][0] cp[0][1] cp[0][2] cp[0][3] cp[0][4] cp[0][5] cp[1][0] cp[1][1] cp[1][2] cp[1][3] cp[1][4] cp[1][5] cp[2][0] cp[2][1] cp[2][2] cp[2][3] cp[2][4] cp[2][5] cp[3][0] cp[3][1] cp[3][2] cp[3][3] cp[3][4] cp[3][5] cp[4][0] cp[4][1] cp[4][2] cp[4][3] cp[4][4] cp[4][5] cp[5][0] cp[5][1] cp[5][2] cp[5][3] cp[5][4] cp[5][5] cp[6][0] cp[6][1] cp[6][2] cp[6][3] cp[6][4] cp[6][5] cp[7][0] cp[7][1] cp[7][2] cp[7][3] cp[7][4] cp[7][5] cp[8][0] cp[8][1] cp[8][2] cp[8][3] cp[8][4] cp[8][5] cp[9][0] cp[9][1] cp[9][2] cp[9][3] cp[9][4] cp[9][5] cp[10][0] cp[10][1] cp[10][2] cp[10][3] cp[10][4] cp[10][5] cp[11][0] cp[11][1] cp[11][2] cp[11][3] cp[11][4] cp[11][5] cp[12][0] cp[12][1] cp[12][2] cp[12][3] cp[12][4] cp[12][5] cp[13][0] cp[13][1] cp[13][2] cp[13][3] cp[13][4] cp[13][5] cp[14][0] cp[14][1] cp[14][2] cp[14][3] cp[14][4] cp[14][5] cp[15][0] cp[15][1] cp[15][2] cp[15][3] cp[15][4] cp[15][5] cp[16][0] cp[16][1] cp[16][2] cp[16][3] cp[16][4] cp[16][5] cp[17][0] cp[17][1] cp[17][2] cp[17][3] cp[17][4] cp[17][5] cp[18][0] cp[18][1] cp[18][2] cp[18][3] cp[18][4] cp[18][5] cp[19][0] cp[19][1] cp[19][2] cp[19][3] cp[19][4] cp[19][5] </list> <values> 3 4 5 5 3 3 2 1 3 4 2 0 5 1 1 0 0 4 0 0 5 3 2 4 3 3 9 10 10 10 10 9 0 0 0 1 0 0 0 0 0 0 3 0 0 0 0 0 0 2 0 0 0 0 0 4 0 0 0 4 0 0 0 0 0 1 0 0 0 0 5 0 0 0 0 3 0 0 0 0 0 0 0 4 0 0 0 0 0 0 4 0 0 0 5 0 0 0 1 0 0 0 0 0 0 0 0 0 0 3 0 3 0 0 0 0 0 4 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 3 0 3 0 0 0 0 0 3 0 0 0 0 0 </values> </instantiation>