| Name | Mario/ Mario-n-medium-5_c18.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 | 169.914 |
| 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 |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291187 | OPT | 771 | 41.0302 | 7.24032 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308956 | OPT | 771 | 49.815 | 8.41964 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297600 | OPT | 771 | 169.914 | 21.9508 |
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> <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] s[15] s[16] s[17] s[18] s[19] s[20] s[21] s[22] s[23] s[24] s[25] s[26] s[27] s[28] s[29] 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] f[15] f[16] f[17] f[18] f[19] f[20] f[21] f[22] f[23] f[24] f[25] f[26] f[27] f[28] f[29] 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] g[15] g[16] g[17] g[18] g[19] g[20] g[21] g[22] g[23] g[24] g[25] g[26] g[27] g[28] g[29] </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>