| Name | Rcpsp/Rcpsp-m1-j60/ Rcpsp-j60-46-08.xml |
| MD5SUM | 1a36b9c979418634ede1d2fbb3d1d330 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 75 |
| Best CPU time to get the best result obtained on this benchmark | 70.2833 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 62 |
| Number of constraints | 135 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 347 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":347,"count":61}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":1},{"degree":7,"count":5},{"degree":8,"count":40},{"degree":9,"count":9},{"degree":10,"count":6}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 60 |
| Distribution of constraint arities | [{"arity":2,"count":131},{"arity":60,"count":4}] |
| 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: 75<instantiation cost = '75'> <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] s[32] s[33] s[34] s[35] s[36] s[37] s[38] s[39] s[40] s[41] s[42] s[43] s[44] s[45] s[46] s[47] s[48] s[49] s[50] s[51] s[52] s[53] s[54] s[55] s[56] s[57] s[58] s[59] s[60] s[61] </list> <values> 0 0 0 0 7 5 6 10 15 25 5 14 12 15 21 13 7 26 22 29 11 26 14 30 13 17 26 32 23 33 43 42 24 22 39 25 39 42 48 34 43 47 31 34 53 55 47 56 60 64 61 62 53 55 56 66 63 63 65 73 69 75 </values> </instantiation>