| Name | Rcpsp/ Rcpsp-j60-01-02_c18.xml |
| MD5SUM | 2a7801ec96cf67d89ec484abe9bad078 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 68 |
| Best CPU time to get the best result obtained on this benchmark | 3.33733 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 62 |
| Number of constraints | 97 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 344 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":344,"count":61}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":3,"count":24},{"degree":4,"count":16},{"degree":5,"count":21},{"degree":6,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":2,"count":93},{"arity":11,"count":1},{"arity":12,"count":1},{"arity":16,"count":1},{"arity":21,"count":1}] |
| 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 |
|---|---|---|---|---|---|
| Mistral-2.0 2018-08-01 (complete) | 4312677 | OPT | 68 | 0.769296 | 0.77105 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312206 | OPT | 68 | 3.33733 | 1.6469 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310346 | OPT | 68 | 3.82441 | 1.78924 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301933 | OPT | 68 | 3.82809 | 1.48157 |
| Concrete 3.9.2-SuperNG (complete) | 4302720 | OPT | 68 | 9.41261 | 4.39388 |
| Concrete 3.9.2 (complete) | 4302370 | OPT | 68 | 9.69653 | 4.52229 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309996 | SAT (TO) | 68 | 252.096 | 246.63 |
| Sat4j-CSP 2018-07-11 (complete) | 4301934 | SAT (TO) | 343 | 252.153 | 178.558 |
| cosoco 1.12 (complete) | 4301935 | ? (NS) | 0.040885 | 0.0419401 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 68<instantiation type="optimum" cost="68"> <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 28 0 0 7 7 37 16 21 24 14 18 14 21 22 22 33 22 24 29 24 24 16 33 28 30 33 16 37 33 51 36 35 28 37 33 37 43 38 45 45 44 36 45 59 37 42 26 44 48 48 54 49 56 59 39 63 58 59 61 66 68 </values> </instantiation>