| Name | Rcpsp/ Rcpsp-j90-01-04_c18.xml |
| MD5SUM | 0eb6d6735b5266ca4e96e7e1d1b2460a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 86 |
| Best CPU time to get the best result obtained on this benchmark | 34.9655 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 92 |
| Number of constraints | 142 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 493 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":493,"count":91}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":3,"count":36},{"degree":4,"count":23},{"degree":5,"count":31},{"degree":6,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 32 |
| Distribution of constraint arities | [{"arity":2,"count":138},{"arity":18,"count":2},{"arity":22,"count":1},{"arity":32,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 138 |
| Distribution of constraint types | [{"type":"intension","count":138},{"type":"cumulative","count":4}] |
| Optimization problem | YES |
| Type of objective | min VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297474 | OPT | 86 | 34.9655 | 4.97436 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308830 | OPT | 86 | 36.3813 | 11.4107 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291061 | OPT | 86 | 38.4216 | 13.7661 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 86<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] </list> <values>0 16 0 0 10 36 5 4 11 13 4 11 21 21 5 13 18 21 13 16 29 14 34 30 21 32 18 37 12 16 25 54 39 37 36 25 25 46 16 45 29 25 22 55 63 23 21 14 48 34 36 34 15 11 39 52 50 37 58 47 40 45 61 58 54 53 53 44 44 40 32 46 44 48 67 28 55 58 59 45 52 67 59 55 65 70 71 74 76 68 82 86 </values> </instantiation>