Name | Rcpsp/Rcpsp-m1-j120/ Rcpsp-j120-50-04.xml |
MD5SUM | 88cc4e0405f00f13705dc5989c1027aa |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 100 |
Best CPU time to get the best result obtained on this benchmark | 244.85899 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 122 |
Number of constraints | 261 |
Number of domains | 2 |
Minimum domain size | 1 |
Maximum domain size | 677 |
Distribution of domain sizes | [{"size":1,"count":1},{"size":677,"count":121}] |
Minimum variable degree | 3 |
Maximum variable degree | 9 |
Distribution of variable degrees | [{"degree":3,"count":3},{"degree":4,"count":6},{"degree":5,"count":20},{"degree":6,"count":49},{"degree":7,"count":26},{"degree":8,"count":15},{"degree":9,"count":3}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 68 |
Distribution of constraint arities | [{"arity":2,"count":257},{"arity":49,"count":1},{"arity":61,"count":1},{"arity":63,"count":1},{"arity":68,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 257 |
Distribution of constraint types | [{"type":"intension","count":257},{"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: 100<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 0 0 8 7 7 16 38 7 1 7 1 36 10 12 8 21 18 5 8 11 23 25 25 28 23 28 26 10 12 28 7 35 18 21 56 25 47 21 30 33 32 30 10 28 38 18 40 35 35 36 36 38 19 34 43 40 30 48 46 53 45 68 47 40 48 33 51 55 52 35 46 59 42 61 50 77 60 50 45 49 57 70 57 67 71 56 49 62 49 70 56 57 79 51 61 78 53 71 58 61 60 74 55 67 77 59 71 78 78 80 80 87 75 77 82 84 92 96 90 100 </values> </instantiation>