| Name | Mario/Mario-zinc-s1/ Mario-n-medium-5.xml |
| MD5SUM | 36a1aa2a38358c951443c34d8d302d49 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 771 |
| Best CPU time to get the best result obtained on this benchmark | 74.6579 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 90 |
| Number of constraints | 61 |
| Number of domains | 56 |
| Minimum domain size | 1 |
| Maximum domain size | 30 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":28},{"size":29,"count":5},{"size":30,"count":55}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":59},{"degree":3,"count":29}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":58},{"arity":30,"count":2}] |
| Number of extensional constraints | 30 |
| Number of intensional constraints | 29 |
| Distribution of constraint types | [{"type":"extension","count":30},{"type":"intension","count":29},{"type":"sum","count":1},{"type":"circuit","count":1}] |
| Optimization problem | YES |
| Type of objective | max SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 771<instantiation id='sol18' type='solution' cost='771'> <list> s[] f[] g[] </list> <values> 2 0 23 6 4 5 18 15 8 29 11 26 12 10 14 20 1 17 7 13 27 21 22 19 24 25 9 16 28 3 46 0 180 194 0 0 273 574 0 1 58 26 0 43 0 45 178 0 41 40 73 0 0 1 0 0 70 61 0 89 0 0 74 24 0 0 54 91 0 21 31 3 0 60 0 90 78 0 17 17 8 0 0 56 0 0 80 47 0 20 </values> </instantiation>