Name | Mario/ Mario-n-medium-2_c18.xml |
MD5SUM | d930a285b222420c6879960cff9efc87 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 1053 |
Best CPU time to get the best result obtained on this benchmark | 336.907 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 90 |
Number of constraints | 61 |
Number of domains | 54 |
Minimum domain size | 1 |
Maximum domain size | 30 |
Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":28},{"size":28,"count":1},{"size":29,"count":5},{"size":30,"count":54}] |
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-08-14 (complete) | 4308953 | OPT | 1053 | 70.6512 | 10.8705 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291184 | OPT | 1053 | 83.7682 | 12.6113 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297597 | OPT | 1053 | 336.907 | 42.9108 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1053<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> 10 0 29 19 1 5 6 2 9 25 22 4 20 13 24 15 12 17 18 16 28 21 14 23 7 3 26 11 27 8 34 0 296 83 13 0 0 31 54 54 207 228 122 0 16 0 23 0 0 85 127 0 270 0 68 152 0 45 34 55 0 0 40 67 89 0 0 19 47 68 94 86 34 0 14 0 67 0 0 31 78 0 99 0 56 14 0 35 53 62 </values> </instantiation>