| 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 | 1.07453 |
| 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 |
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> ncr[] cp[][] nco[] prd[] </list> <values> 10 10 10 9 10 9 0 0 0 0 0 1 0 0 3 0 0 0 0 0 0 2 0 0 0 4 0 0 0 0 0 0 0 0 0 4 0 0 0 0 1 0 0 0 0 0 5 0 0 3 0 0 0 0 0 0 0 0 0 4 0 0 0 0 4 0 0 0 0 5 0 0 1 0 0 0 0 0 3 0 0 0 0 0 0 0 3 0 0 0 0 0 4 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 3 0 0 0 0 0 3 0 0 0 0 0 0 3 0 0 0 0 4 3 3 4 3 3 5 2 3 1 5 4 4 1 5 4 3 0 0 2 2 3 3 0 0 1 </values> </instantiation>