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 | 105 |
Best CPU time to get the best result obtained on this benchmark | 250.865 |
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 - Conflict Ordering with restarts 2018-08-17 (complete) | 4312197 | SAT | 105 | 250.865 | 247.376 |
OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309987 | SAT | 107 | 251.752 | 247.375 |
OscaR - Hybrid 2018-08-14 (complete) | 4310337 | SAT (TO) | 107 | 252.062 | 244.837 |
Mistral-2.0 2018-08-01 (complete) | 4312671 | SAT (TO) | 109 | 252.009 | 252.011 |
Concrete 3.9.2-SuperNG (complete) | 4302711 | SAT (TO) | 113 | 252.112 | 238.642 |
Concrete 3.9.2 (complete) | 4302361 | SAT (TO) | 113 | 252.151 | 238.936 |
Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301915 | SAT (TO) | 115 | 252.051 | 245.216 |
cosoco 1.12 (complete) | 4301917 | ? (NS) | 0.076975 | 0.0779381 | |
Sat4j-CSP 2018-07-11 (complete) | 4301916 | ? (TO) | 259.854 | 87.1562 |
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[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[0] s[121] </list> <values> 0 0 0 4 4 10 2 4 6 20 6 2 14 4 11 10 26 13 41 10 19 27 30 43 10 61 20 30 23 35 27 35 24 39 44 33 32 21 29 81 69 53 39 48 23 50 49 55 64 18 62 10 42 38 29 45 64 39 25 35 46 64 77 8 72 50 40 21 26 52 65 36 71 81 57 60 67 66 55 55 73 25 84 51 74 72 54 71 83 72 87 50 50 67 46 81 77 47 92 75 82 56 55 74 90 87 90 98 71 101 89 88 92 88 92 95 71 102 97 96 0 105 </values> </instantiation>