| Name | Fapp/Fapp-m2s/ Fapp-m2s-ex2_c18.xml |
| MD5SUM | becbd2d91dde2be36fb4b4a471bae430 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 13871 |
| Best CPU time to get the best result obtained on this benchmark | 2.40972 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 61 |
| Number of constraints | 34 |
| Number of domains | 13 |
| Minimum domain size | 1 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":21},{"size":6,"count":2},{"size":8,"count":1},{"size":11,"count":14},{"size":12,"count":1},{"size":16,"count":2},{"size":26,"count":1},{"size":65,"count":1},{"size":76,"count":4},{"size":100,"count":12}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 15 |
| Distribution of variable degrees | [{"degree":2,"count":45},{"degree":3,"count":4},{"degree":4,"count":6},{"degree":5,"count":4},{"degree":6,"count":1},{"degree":15,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":3,"count":14},{"arity":6,"count":14}] |
| Number of extensional constraints | 14 |
| Number of intensional constraints | 20 |
| Distribution of constraint types | [{"type":"extension","count":14},{"type":"intension","count":20}] |
| 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: 13871<instantiation type="optimum" cost="13871"> <list> f[0] f[1] f[2] f[3] f[4] f[5] f[6] f[7] f[8] p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] k v1[0] v1[1] v1[2] v1[3] v1[4] v1[5] v1[6] v1[7] v1[8] v1[9] v1[10] v1[11] v1[12] v1[13] v2[0] v2[1] v2[2] v2[3] v2[4] v2[5] v2[6] v2[7] v2[8] v2[9] v2[10] v2[11] v2[12] v2[13] d[0] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] d[10] d[11] d[12] d[13] </list> <values> 31 31 67 65 100 1 55 81 61 0 0 1 1 1 1 0 0 0 7 0 0 0 0 1 0 0 0 0 0 0 0 0 0 2 0 0 3 6 0 0 0 0 0 0 0 0 0 36 30 34 69 30 33 66 35 10 99 39 80 60 20 </values> </instantiation>