| Name | Bacp/Bacp-m2/ Bacp-m2-06_c18.xml |
| MD5SUM | a425e3c2d344a7c12b87076aad716824 |
| 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 | 0.711821 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 152 |
| Number of constraints | 166 |
| Number of domains | 4 |
| 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 | 9 |
| Distribution of variable degrees | [{"degree":1,"count":6},{"degree":2,"count":6},{"degree":4,"count":120},{"degree":6,"count":2},{"degree":7,"count":11},{"degree":8,"count":4},{"degree":9,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":2,"count":134},{"arity":6,"count":20},{"arity":21,"count":12}] |
| Number of extensional constraints | 120 |
| Number of intensional constraints | 14 |
| Distribution of constraint types | [{"type":"extension","count":120},{"type":"intension","count":14},{"type":"sum","count":32}] |
| 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: 10<instantiation> <list> prd[] pc[][] ncr[] nco[] </list> <values> 5 4 4 0 5 5 4 2 5 2 3 1 0 2 3 1 3 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 10 8 10 10 10 10 3 4 3 3 3 4 </values> </instantiation>