| Name | Rcpsp/Rcpsp-m1-j60/ Rcpsp-j60-13-09.xml |
| MD5SUM | 19b417ad6dc2829e4bf67cafab0f775d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 107 |
| Best CPU time to get the best result obtained on this benchmark | 251.83099 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 62 |
| Number of constraints | 97 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 349 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":349,"count":61}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":1},{"degree":6,"count":22},{"degree":7,"count":18},{"degree":8,"count":18},{"degree":9,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 60 |
| Distribution of constraint arities | [{"arity":2,"count":93},{"arity":60,"count":4}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 93 |
| Distribution of constraint types | [{"type":"intension","count":93},{"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 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] </list> <values> 0 0 0 2 1 1 20 13 11 30 21 2 27 23 11 15 26 66 31 46 2 10 41 45 28 56 15 50 27 20 78 76 21 59 54 48 34 58 86 78 66 32 63 61 86 68 78 62 36 88 54 39 68 77 68 87 49 91 101 97 91 107 </values> </instantiation>