| Name | Rcpsp/ Rcpsp-j90-01-03_c18.xml |
| MD5SUM | ecfa46aa6dcbda2e31280fbe487bc54f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 66 |
| Best CPU time to get the best result obtained on this benchmark | 5.05836 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 92 |
| Number of constraints | 142 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 459 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":459,"count":91}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":3,"count":35},{"degree":4,"count":25},{"degree":5,"count":30},{"degree":6,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 29 |
| Distribution of constraint arities | [{"arity":2,"count":138},{"arity":14,"count":1},{"arity":23,"count":1},{"arity":24,"count":1},{"arity":29,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 138 |
| Distribution of constraint types | [{"type":"intension","count":138},{"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: 66<instantiation type="optimum" cost="66"> <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 6 6 6 9 8 6 9 18 9 8 2 45 8 11 16 13 19 13 21 22 32 2 20 26 18 18 20 16 32 43 21 28 21 32 30 2 20 23 19 33 21 12 40 27 38 41 20 40 19 32 10 34 40 28 34 12 43 46 32 55 31 49 44 32 44 33 50 40 40 49 46 43 21 52 50 62 43 52 51 52 53 53 58 28 56 55 65 66 </values> </instantiation>