Name | Rcpsp/Rcpsp-m1-j60/ Rcpsp-j60-21-05.xml |
MD5SUM | 42feabc1334beaea3bf22cfd312dd4ae |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 89 |
Best CPU time to get the best result obtained on this benchmark | 306.205 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 62 |
Number of constraints | 116 |
Number of domains | 2 |
Minimum domain size | 1 |
Maximum domain size | 327 |
Distribution of domain sizes | [{"size":1,"count":1},{"size":327,"count":61}] |
Minimum variable degree | 3 |
Maximum variable degree | 8 |
Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":11},{"degree":5,"count":14},{"degree":6,"count":16},{"degree":7,"count":12},{"degree":8,"count":5}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 32 |
Distribution of constraint arities | [{"arity":2,"count":112},{"arity":28,"count":1},{"arity":29,"count":1},{"arity":32,"count":2}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 112 |
Distribution of constraint types | [{"type":"intension","count":112},{"type":"cumulative","count":4}] |
Optimization problem | YES |
Type of objective | min VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 89<instantiation> <list> s[] </list> <values> 0 0 0 0 2 14 10 10 4 13 32 20 13 8 42 79 31 12 23 21 10 52 40 27 20 30 21 38 34 21 30 43 40 27 35 65 48 50 22 49 53 57 64 50 64 42 50 49 27 54 55 72 64 66 70 74 77 77 81 82 68 89 </values> </instantiation>