| Name | Rcpsp/ Rcpsp-j120-01-02_c18.xml |
| MD5SUM | 9e298a48575be159e0b6ad4a2fcf836a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 109 |
| Best CPU time to get the best result obtained on this benchmark | 166.12 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 122 |
| Number of constraints | 187 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 642 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":642,"count":121}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":3,"count":45},{"degree":4,"count":34},{"degree":5,"count":42},{"degree":6,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":2,"count":183},{"arity":22,"count":1},{"arity":27,"count":1},{"arity":31,"count":1},{"arity":40,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 183 |
| Distribution of constraint types | [{"type":"intension","count":183},{"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: 109<instantiation> <list> 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] s[92] s[93] s[94] s[95] s[96] s[97] s[98] s[99] s[100] s[101] s[102] s[103] s[104] s[105] s[106] s[107] s[108] s[109] s[110] s[111] s[112] s[113] s[114] s[115] s[116] s[117] s[118] s[119] s[120] s[0] s[121] </list> <values> 0 0 0 1 19 7 2 21 6 27 14 7 16 18 30 35 16 14 16 40 7 22 40 5 50 38 53 4 25 20 22 64 33 30 44 36 36 32 63 73 19 24 33 56 93 47 30 31 48 49 28 28 40 23 75 68 67 43 57 49 3 48 72 72 88 32 27 16 56 53 42 71 63 86 50 64 43 45 59 74 73 50 43 56 79 63 67 74 78 71 84 70 72 65 65 91 91 80 87 86 96 89 80 86 77 57 82 81 84 95 91 88 90 85 92 91 101 101 104 101 0 109 </values> </instantiation>