| Name | Rcpsp/ Rcpsp-j120-01-01_c18.xml |
| MD5SUM | 0be9a53bf20a889479382bc05b2f6618 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 108 |
| Best CPU time to get the best result obtained on this benchmark | 20077.2 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 122 |
| Number of constraints | 187 |
| Number of domains | 2 |
| Minimum domain size | 1 |
| Maximum domain size | 667 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":667,"count":121}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":3,"count":46},{"degree":4,"count":33},{"degree":5,"count":41},{"degree":6,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 43 |
| Distribution of constraint arities | [{"arity":2,"count":183},{"arity":24,"count":2},{"arity":29,"count":1},{"arity":43,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 183 |
| Distribution of constraint types | [{"type":"intension","count":183},{"type":"cumulative","count":4}] |
| Optimization problem | YES |
| Type of objective | min VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291046 | SAT (TO) | 105 | 8992.66 | 2520.1 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308815 | SAT (TO) | 106 | 13338.5 | 2520.11 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297459 | SAT (TO) | 108 | 20077.2 | 2520.12 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 105<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] s[92] s[93] s[94] s[95] s[96] s[97] s[98] s[99] s[100] s[101] s[102] s[103] s[104] s[105] s[106] s[107] s[108] s[109] s[110] s[111] s[112] s[113] s[114] s[115] s[116] s[117] s[118] s[119] s[120] s[121] </list> <values> 0 0 1 3 16 5 10 5 10 6 20 9 10 13 7 19 24 26 25 29 10 19 39 27 30 18 45 28 45 35 51 47 35 19 64 44 42 8 17 20 90 37 53 17 44 42 25 70 55 62 37 62 10 29 37 35 64 34 46 7 38 42 64 74 8 82 44 70 59 44 50 37 49 71 54 50 73 84 64 69 53 73 57 54 58 77 75 38 84 55 72 91 86 77 79 61 79 72 62 92 46 82 67 61 77 94 87 92 100 76 52 89 87 91 87 92 95 82 102 97 96 105 </values> </instantiation>