| Name | Rack/ Rack-m1c-s1/Rack-m1c-r2.xml |
| MD5SUM | a7a611711d538e27d6e463316b2ea293 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 1100 |
| Best CPU time to get the best result obtained on this benchmark | 5.7864599 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 80 |
| Number of constraints | 56 |
| Number of domains | 6 |
| Minimum domain size | 3 |
| Maximum domain size | 17 |
| Distribution of domain sizes | [{"size":3,"count":50},{"size":5,"count":10},{"size":9,"count":10},{"size":17,"count":10}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":30},{"degree":3,"count":38},{"degree":4,"count":10},{"degree":5,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":2,"count":30},{"arity":4,"count":1},{"arity":5,"count":20},{"arity":10,"count":5}] |
| Number of extensional constraints | 30 |
| Number of intensional constraints | 1 |
| Distribution of constraint types | [{"type":"extension","count":30},{"type":"intension","count":1},{"type":"ordered","count":1},{"type":"sum","count":24}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1100<instantiation> <list> r[0] r[1] r[2] r[3] r[4] r[5] r[6] r[7] r[8] r[9] c[0][0] c[0][1] c[0][2] c[0][3] c[1][0] c[1][1] c[1][2] c[1][3] c[2][0] c[2][1] c[2][2] c[2][3] c[3][0] c[3][1] c[3][2] c[3][3] c[4][0] c[4][1] c[4][2] c[4][3] c[5][0] c[5][1] c[5][2] c[5][3] c[6][0] c[6][1] c[6][2] c[6][3] c[7][0] c[7][1] c[7][2] c[7][3] c[8][0] c[8][1] c[8][2] c[8][3] c[9][0] c[9][1] c[9][2] c[9][3] rpw[0] rpw[1] rpw[2] rpw[3] rpw[4] rpw[5] rpw[6] rpw[7] rpw[8] rpw[9] rcn[0] rcn[1] rcn[2] rcn[3] rcn[4] rcn[5] rcn[6] rcn[7] rcn[8] rcn[9] rpr[0] rpr[1] rpr[2] rpr[3] rpr[4] rpr[5] rpr[6] rpr[7] rpr[8] rpr[9] </list> <values> 2 1 1 1 1 1 1 0 0 0 8 1 0 0 0 0 0 2 1 2 1 0 5 0 1 0 1 2 1 0 0 3 0 0 5 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 200 150 150 150 150 150 150 0 0 0 16 8 8 8 8 8 8 0 0 0 200 150 150 150 150 150 150 0 0 0 </values> </instantiation>