| Name | Scheduling/Scheduling-jsdec-sadeh/ Sadeh-enddr1-7.xml |
| MD5SUM | 7d172624d7d2d86f32f8d29666a5f8b7 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.021906 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 95 |
| Number of domains | 1 |
| Minimum domain size | 162 |
| Maximum domain size | 162 |
| Distribution of domain sizes | [{"size":162,"count":50}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":20},{"degree":4,"count":30}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":1,"count":50},{"arity":2,"count":40},{"arity":10,"count":5}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 90 |
| Distribution of constraint types | [{"type":"intension","count":90},{"type":"noOverlap","count":5}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[9][0] x[9][1] x[9][2] x[9][3] x[9][4] </list> <values> 12 20 24 36 46 0 9 36 48 51 8 17 48 59 66 1 14 59 74 82 22 32 74 86 93 32 38 86 96 99 24 51 96 109 115 11 35 109 120 141 62 72 120 130 141 19 71 130 148 153 </values> </instantiation>