Name | Rcpsp/Rcpsp-m1-j60/ Rcpsp-j60-21-01.xml |
MD5SUM | 90855c6c3ff0f3816786e6ae00e0aae6 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 103 |
Best CPU time to get the best result obtained on this benchmark | 99.291 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 62 |
Number of constraints | 116 |
Number of domains | 2 |
Minimum domain size | 1 |
Maximum domain size | 332 |
Distribution of domain sizes | [{"size":1,"count":1},{"size":332,"count":61}] |
Minimum variable degree | 3 |
Maximum variable degree | 8 |
Distribution of variable degrees | [{"degree":3,"count":2},{"degree":4,"count":9},{"degree":5,"count":20},{"degree":6,"count":15},{"degree":7,"count":14},{"degree":8,"count":2}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 36 |
Distribution of constraint arities | [{"arity":2,"count":112},{"arity":26,"count":1},{"arity":28,"count":1},{"arity":31,"count":1},{"arity":36,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 112 |
Distribution of constraint types | [{"type":"intension","count":112},{"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: 103<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] </list> <values>0 0 0 0 3 9 8 24 23 15 33 4 24 39 8 8 31 18 49 71 39 29 38 18 41 49 41 46 44 58 31 57 60 68 48 42 52 49 64 68 57 70 57 77 66 77 90 80 80 87 82 91 94 85 95 80 75 93 99 102 77 103 </values> </instantiation>