| Name | Rcpsp/Rcpsp-m1-j60/ Rcpsp-j60-37-01.xml |
| MD5SUM | cc0e4d4fb1187992b98efb1fb4f076c6 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 97 |
| Best CPU time to get the best result obtained on this benchmark | 201.766 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 62 |
| Number of constraints | 135 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 300 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":300,"count":61}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":4},{"degree":5,"count":10},{"degree":6,"count":23},{"degree":7,"count":17},{"degree":8,"count":6},{"degree":10,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":2,"count":131},{"arity":26,"count":1},{"arity":27,"count":1},{"arity":32,"count":1},{"arity":36,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 131 |
| Distribution of constraint types | [{"type":"intension","count":131},{"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: 97<instantiation> <list> s[] </list> <values> 0 9 0 0 15 5 8 8 8 22 15 31 44 35 14 22 46 25 45 31 18 35 55 55 39 31 37 25 42 45 39 45 60 52 78 52 47 74 39 56 61 62 54 55 48 57 52 59 61 71 60 61 83 75 66 86 71 78 90 83 91 97 </values> </instantiation>