| Name | Rcpsp/Rcpsp-m1-j90/ Rcpsp-j90-26-08.xml |
| MD5SUM | 885f7dce9f12482b5755a1b8bd42ad86 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 83 |
| Best CPU time to get the best result obtained on this benchmark | 244.285 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 92 |
| Number of constraints | 170 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 532 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":532,"count":91}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":3,"count":3},{"degree":4,"count":2},{"degree":5,"count":14},{"degree":6,"count":27},{"degree":7,"count":23},{"degree":8,"count":15},{"degree":9,"count":6},{"degree":10,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 72 |
| Distribution of constraint arities | [{"arity":2,"count":166},{"arity":59,"count":1},{"arity":68,"count":1},{"arity":72,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 166 |
| Distribution of constraint types | [{"type":"intension","count":166},{"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: 83<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] 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] s[62] s[63] s[64] s[65] s[66] s[67] s[68] s[69] s[70] s[71] s[72] s[73] s[74] s[75] s[76] s[77] s[78] s[79] s[80] s[81] s[82] s[83] s[84] s[85] s[86] s[87] s[88] s[89] s[90] s[91] </list> <values> 0 0 0 0 4 10 11 12 8 17 16 15 15 5 21 29 31 25 4 21 56 30 34 9 5 21 41 18 8 34 21 39 17 7 9 30 31 29 62 19 32 25 7 25 31 38 38 41 66 14 25 51 58 40 38 39 37 72 43 31 45 39 48 46 48 35 54 47 49 70 60 63 53 57 53 67 60 62 61 67 69 56 70 64 62 72 67 67 78 74 77 83 </values> </instantiation>