| Name | Rcpsp/Rcpsp-m1-j30/ Rcpsp-j30-45-01.xml |
| MD5SUM | 1713c5d1d522f34d444b6ff7755d5ded |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 82 |
| Best CPU time to get the best result obtained on this benchmark | 273.014 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 32 |
| Number of constraints | 72 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 151 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":151,"count":31}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":1},{"degree":7,"count":1},{"degree":8,"count":21},{"degree":9,"count":5},{"degree":10,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":2,"count":68},{"arity":30,"count":4}] |
| 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: 82<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] s[30] s[31] </list> <values>0 0 6 0 5 30 10 20 27 10 4 17 20 2 24 29 34 28 40 40 54 49 49 58 62 72 54 66 73 76 68 82 </values> </instantiation>