| Name | Rcpsp/Rcpsp-m1-j120/ Rcpsp-j120-23-09.xml |
| MD5SUM | eccc16cbaa217285dad955f7b1421169 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 107 |
| Best CPU time to get the best result obtained on this benchmark | 3.2384901 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 122 |
| Number of constraints | 224 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 655 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":655,"count":121}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":3,"count":23},{"degree":4,"count":18},{"degree":5,"count":68},{"degree":6,"count":11},{"degree":7,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 32 |
| Distribution of constraint arities | [{"arity":2,"count":220},{"arity":27,"count":1},{"arity":29,"count":1},{"arity":32,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 220 |
| Distribution of constraint types | [{"type":"intension","count":220},{"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: 107<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] 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[121] </list> <values>0 0 9 0 6 9 9 16 19 27 12 11 29 11 18 9 20 6 22 20 34 12 34 18 23 40 17 18 27 32 32 22 19 29 50 12 22 53 29 46 32 18 40 29 32 47 20 31 47 22 43 56 49 32 37 34 57 48 36 11 43 49 43 44 36 55 53 29 49 63 29 41 23 51 29 50 65 54 37 46 58 67 65 53 48 67 58 65 51 73 77 43 82 69 74 86 72 75 73 69 65 76 78 87 81 52 96 27 46 82 90 83 96 82 84 90 87 98 98 97 103 107 </values> </instantiation>