| Name | Rcpsp/ Rcpsp-j60-01-03_c18.xml |
| MD5SUM | 0a05dcabfe37de5e4866d51519fc1f6c |
| 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 | 1.76401 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 62 |
| Number of constraints | 97 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 316 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":316,"count":61}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":3,"count":23},{"degree":4,"count":19},{"degree":5,"count":18},{"degree":6,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 18 |
| Distribution of constraint arities | [{"arity":2,"count":93},{"arity":12,"count":1},{"arity":14,"count":1},{"arity":16,"count":1},{"arity":18,"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) | 4312672 | OPT | 68 | 0.546511 | 0.551291 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301918 | OPT | 68 | 1.76401 | 0.768021 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312207 | OPT | 68 | 2.90986 | 1.5147 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310347 | OPT | 68 | 3.49753 | 2.06502 |
| Concrete 3.9.2 (complete) | 4302371 | OPT | 68 | 8.90707 | 4.12446 |
| Concrete 3.9.2-SuperNG (complete) | 4302721 | OPT | 68 | 9.50078 | 4.26412 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309997 | SAT (TO) | 68 | 252.103 | 246.617 |
| Sat4j-CSP 2018-07-11 (complete) | 4301919 | SAT (TO) | 309 | 252.165 | 170.373 |
| cosoco 1.12 (complete) | 4301920 | ? (NS) | 0.040444 | 0.0415281 |
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 0 0 0 14 31 6 16 6 12 7 15 15 48 16 14 7 12 16 25 19 19 19 30 28 15 1 6 19 31 33 40 19 38 25 22 16 25 32 22 35 31 38 46 31 28 44 56 32 48 39 49 33 54 37 43 51 53 59 62 63 68 </values> </instantiation>