Name | Rcpsp/Rcpsp-m1-j30/ Rcpsp-j30-41-06.xml |
MD5SUM | 9c0419560fe3c6efa350d2101b8d9fdb |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 103 |
Best CPU time to get the best result obtained on this benchmark | 115.382 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 32 |
Number of constraints | 72 |
Number of domains | 2 |
Minimum domain size | 1 |
Maximum domain size | 155 |
Distribution of domain sizes | [{"size":1,"count":1},{"size":155,"count":31}] |
Minimum variable degree | 3 |
Maximum variable degree | 10 |
Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":1},{"degree":5,"count":1},{"degree":6,"count":3},{"degree":7,"count":16},{"degree":8,"count":5},{"degree":9,"count":4},{"degree":10,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 26 |
Distribution of constraint arities | [{"arity":2,"count":68},{"arity":21,"count":2},{"arity":23,"count":1},{"arity":26,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 68 |
Distribution of constraint types | [{"type":"intension","count":68},{"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: 103<instantiation> <list> s[] </list> <values> 0 0 29 13 9 16 20 31 9 47 48 30 47 57 43 64 66 36 52 80 88 65 73 81 52 80 56 84 98 96 92 103 </values> </instantiation>