| Name | Rack/ Rack-m1c-s1/Rack-m1c-r1.xml |
| MD5SUM | 363bab3579cb814ec3389af888051029 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 550 |
| Best CPU time to get the best result obtained on this benchmark | 0.0080859996 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 31 |
| Number of domains | 6 |
| Minimum domain size | 2 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":2,"count":5},{"size":3,"count":25},{"size":5,"count":5},{"size":11,"count":5}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":15},{"degree":3,"count":18},{"degree":4,"count":5},{"degree":5,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":2,"count":15},{"arity":4,"count":1},{"arity":5,"count":15}] |
| Number of extensional constraints | 15 |
| Number of intensional constraints | 1 |
| Distribution of constraint types | [{"type":"extension","count":15},{"type":"intension","count":1},{"type":"ordered","count":1},{"type":"sum","count":14}] |
| 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: 550<instantiation type='solution' cost='-550'> <list>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] r[0] r[1] r[2] r[3] r[4] rcn[0] rcn[1] rcn[2] rcn[3] rcn[4] rpr[0] rpr[1] rpr[2] rpr[3] rpr[4] rpw[0] rpw[1] rpw[2] rpw[3] rpw[4] </list> <values>7 0 1 0 2 4 0 0 1 0 1 1 0 0 0 0 0 0 0 0 2 2 1 0 0 16 16 8 0 0 200 200 150 0 0 200 200 150 0 0 </values> </instantiation>