| Name | Mario/ Mario-easy-2_c18.xml |
| MD5SUM | f67e3538ea675b4814e62926b7227759 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 628 |
| Best CPU time to get the best result obtained on this benchmark | 1.31422 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 45 |
| Number of constraints | 31 |
| Number of domains | 29 |
| Minimum domain size | 1 |
| Maximum domain size | 15 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":13},{"size":14,"count":3},{"size":15,"count":27}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":29},{"degree":3,"count":14}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":28},{"arity":15,"count":2}] |
| Number of extensional constraints | 15 |
| Number of intensional constraints | 14 |
| Distribution of constraint types | [{"type":"extension","count":15},{"type":"intension","count":14},{"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: 628<instantiation type="optimum" cost="628"> <list> s[0] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] f[0] f[1] f[2] f[3] f[4] f[5] f[6] f[7] f[8] f[9] f[10] f[11] f[12] f[13] f[14] g[0] g[1] g[2] g[3] g[4] g[5] g[6] g[7] g[8] g[9] g[10] g[11] g[12] g[13] g[14] </list> <values> 11 0 7 6 14 3 9 5 2 1 4 12 10 8 13 18 0 5 31 294 80 27 12 161 529 101 33 334 167 143 0 0 40 67 89 50 6 19 47 68 94 86 34 14 14 </values> </instantiation>