| Name | Fapp/Fapp-m2s/ Fapp-m2s-ex1_c18.xml |
| MD5SUM | 7185d5885598b7dd528d8e2d67548d5f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 523 |
| Best CPU time to get the best result obtained on this benchmark | 0.877161 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 21 |
| Number of constraints | 8 |
| Number of domains | 5 |
| Minimum domain size | 2 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":2,"count":8},{"size":11,"count":4},{"size":12,"count":1},{"size":100,"count":8}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":16},{"degree":3,"count":2},{"degree":5,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":3,"count":4},{"arity":6,"count":4}] |
| Number of extensional constraints | 4 |
| Number of intensional constraints | 4 |
| Distribution of constraint types | [{"type":"extension","count":4},{"type":"intension","count":4}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 523<instantiation type="optimum" cost="523"> <list> f[0] f[1] f[2] f[3] p[0] p[1] p[2] p[3] k v1[0] v1[1] v1[2] v1[3] v2[0] v2[1] v2[2] v2[3] d[0] d[1] d[2] d[3] </list> <values> 47 100 1 70 0 1 1 0 3 0 1 0 0 1 2 0 0 53 46 99 30 </values> </instantiation>