| Name | Rcpsp/ Rcpsp-j120-01-03_c18.xml |
| MD5SUM | 23ddd46bc08a13908205cdb197974328 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 126 |
| Best CPU time to get the best result obtained on this benchmark | 2520.03 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 122 |
| Number of constraints | 187 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 663 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":663,"count":121}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":3,"count":50},{"degree":4,"count":27},{"degree":5,"count":41},{"degree":6,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":2,"count":183},{"arity":24,"count":1},{"arity":26,"count":1},{"arity":30,"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: 126<instantiation type="solution"> <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 0 10 3 10 3 19 6 7 6 28 19 8 8 64 17 28 17 30 24 8 29 49 8 30 7 7 28 7 40 95 21 40 57 49 66 87 67 40 28 32 14 30 39 27 17 72 35 49 26 36 25 10 19 54 25 21 38 13 40 44 80 69 59 7 72 59 14 39 53 44 49 71 85 43 71 27 64 100 92 92 100 27 57 101 62 33 106 46 85 96 18 65 66 71 74 83 101 29 104 39 66 59 115 75 59 87 77 71 81 103 95 112 75 105 116 83 124 115 121 126 </values> </instantiation>