Name | Rcpsp/Rcpsp-m1-j30/ Rcpsp-j30-40-08.xml |
MD5SUM | a1a47bf7c0dfac46ae24643a1dca38e9 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 57 |
Best CPU time to get the best result obtained on this benchmark | 0.30547801 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 32 |
Number of constraints | 72 |
Number of domains | 2 |
Minimum domain size | 1 |
Maximum domain size | 177 |
Distribution of domain sizes | [{"size":1,"count":1},{"size":177,"count":31}] |
Minimum variable degree | 3 |
Maximum variable degree | 9 |
Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":1},{"degree":5,"count":6},{"degree":6,"count":12},{"degree":7,"count":9},{"degree":8,"count":1},{"degree":9,"count":2}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 17 |
Distribution of constraint arities | [{"arity":2,"count":68},{"arity":14,"count":2},{"arity":16,"count":1},{"arity":17,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 68 |
Distribution of constraint types | [{"type":"intension","count":68},{"type":"cumulative","count":4}] |
Optimization problem | YES |
Type of objective | min VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 57<instantiation type="optimum" cost="57"> <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] </list> <values> 0 0 0 0 10 5 10 5 20 10 20 12 5 20 20 12 26 24 30 30 22 35 24 35 36 33 41 40 33 41 51 57 </values> </instantiation>