| Name | Bacp/Bacp-m1/ Bacp-m1-07a_c18.xml |
| MD5SUM | 31fd8745bd40eddef0de95e701108e5a |
| 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 | 107.185 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 238 |
| Number of constraints | 63 |
| Number of domains | 8 |
| Minimum domain size | 2 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":2,"count":196},{"size":6,"count":7},{"size":7,"count":28},{"size":11,"count":7}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":1,"count":7},{"degree":2,"count":203},{"degree":8,"count":4},{"degree":9,"count":12},{"degree":10,"count":8},{"degree":11,"count":2},{"degree":12,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 29 |
| Distribution of constraint arities | [{"arity":2,"count":21},{"arity":8,"count":28},{"arity":29,"count":14}] |
| Number of extensional constraints | 28 |
| Number of intensional constraints | 21 |
| Distribution of constraint types | [{"type":"extension","count":28},{"type":"intension","count":21},{"type":"sum","count":7},{"type":"count","count":7}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
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> <list> prd[] cp[][] ncr[] nco[] </list> <values> 2 5 4 0 6 6 1 2 6 3 5 0 4 5 3 1 0 2 1 3 1 5 4 0 6 4 0 2 0 0 3 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 2 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 1 0 5 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 4 0 0 0 4 0 0 0 0 0 0 0 0 5 0 1 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 3 0 0 0 0 4 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 3 0 0 0 0 0 3 0 0 0 0 0 0 0 0 3 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 3 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 3 0 0 3 0 0 0 0 0 0 0 0 3 0 0 0 0 12 12 12 11 11 12 12 5 4 4 3 4 4 4 </values> </instantiation>