Name | Mario/Mario-zinc-s1/ Mario-n-medium-3.xml |
MD5SUM | 5e375f515acf7f26619053bdd8bbc393 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 943 |
Best CPU time to get the best result obtained on this benchmark | 57.1424 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 90 |
Number of constraints | 61 |
Number of domains | 57 |
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":8},{"size":30,"count":51}] |
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: 943<instantiation id='sol18' type='solution' cost='943'> <list> s[] f[] g[] </list> <values> 27 0 2 13 4 5 22 7 8 9 10 11 12 21 14 15 19 17 3 18 1 6 26 28 24 25 29 16 20 23 178 0 0 28 0 0 42 0 0 0 0 0 0 77 0 0 137 0 63 161 67 99 337 19 0 0 44 181 216 265 0 0 0 81 0 0 49 0 0 0 0 0 0 14 0 0 76 0 86 99 11 92 85 95 0 0 57 59 46 93 </values> </instantiation>