| Name | Rcpsp/ Rcpsp-j60-01-01_c18.xml |
| MD5SUM | 03892ae4f8c09e3dcf1eb144c7e7557f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 77 |
| Best CPU time to get the best result obtained on this benchmark | 2.48432 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 62 |
| Number of constraints | 97 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 329 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":329,"count":61}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":3,"count":22},{"degree":4,"count":19},{"degree":5,"count":21}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":2,"count":93},{"arity":14,"count":2},{"arity":16,"count":2}] |
| 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 |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297467 | OPT | 77 | 2.48432 | 0.876108 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291054 | OPT | 77 | 16.2558 | 5.96885 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308823 | OPT | 77 | 17.7517 | 6.07417 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 77<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 10 16 8 10 19 10 19 19 20 1 8 16 21 26 26 19 22 16 16 22 13 44 25 36 1 35 26 24 36 3 20 35 35 24 42 20 9 44 29 27 29 35 45 52 50 39 42 52 46 54 58 47 68 58 74 52 55 77 </values> </instantiation>