| Name | Rack/ Rack-m1c-s1/Rack-m1c-r3.xml |
| MD5SUM | bc26aaa932070946748b52cb6241d030 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 1200 |
| Best CPU time to get the best result obtained on this benchmark | 240.002 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 120 |
| Number of constraints | 68 |
| Number of domains | 8 |
| Minimum domain size | 2 |
| Maximum domain size | 17 |
| Distribution of domain sizes | [{"size":2,"count":12},{"size":3,"count":60},{"size":5,"count":12},{"size":9,"count":12},{"size":11,"count":12},{"size":17,"count":12}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":36},{"degree":3,"count":70},{"degree":4,"count":12},{"degree":5,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 12 |
| Distribution of constraint arities | [{"arity":2,"count":36},{"arity":4,"count":1},{"arity":7,"count":24},{"arity":12,"count":7}] |
| Number of extensional constraints | 36 |
| Number of intensional constraints | 1 |
| Distribution of constraint types | [{"type":"extension","count":36},{"type":"intension","count":1},{"type":"ordered","count":1},{"type":"sum","count":30}] |
| 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: 1200<instantiation type='solution' cost='-1200'> <list>c[0][0] c[0][1] c[0][2] c[0][3] c[0][4] c[0][5] c[10][0] c[10][1] c[10][2] c[10][3] c[10][4] c[10][5] c[11][0] c[11][1] c[11][2] c[11][3] c[11][4] c[11][5] c[1][0] c[1][1] c[1][2] c[1][3] c[1][4] c[1][5] c[2][0] c[2][1] c[2][2] c[2][3] c[2][4] c[2][5] c[3][0] c[3][1] c[3][2] c[3][3] c[3][4] c[3][5] c[4][0] c[4][1] c[4][2] c[4][3] c[4][4] c[4][5] c[5][0] c[5][1] c[5][2] c[5][3] c[5][4] c[5][5] c[6][0] c[6][1] c[6][2] c[6][3] c[6][4] c[6][5] c[7][0] c[7][1] c[7][2] c[7][3] c[7][4] c[7][5] c[8][0] c[8][1] c[8][2] c[8][3] c[8][4] c[8][5] c[9][0] c[9][1] c[9][2] c[9][3] c[9][4] c[9][5] r[0] r[10] r[11] r[1] r[2] r[3] r[4] r[5] r[6] r[7] r[8] r[9] rcn[0] rcn[10] rcn[11] rcn[1] rcn[2] rcn[3] rcn[4] rcn[5] rcn[6] rcn[7] rcn[8] rcn[9] rpr[0] rpr[10] rpr[11] rpr[1] rpr[2] rpr[3] rpr[4] rpr[5] rpr[6] rpr[7] rpr[8] rpr[9] rpw[0] rpw[10] rpw[11] rpw[1] rpw[2] rpw[3] rpw[4] rpw[5] rpw[6] rpw[7] rpw[8] rpw[9] </list> <values>8 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 2 0 0 0 5 0 0 0 0 5 0 1 0 0 0 0 0 3 0 0 2 5 0 0 0 0 5 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 2 2 1 1 1 1 0 0 0 16 0 0 16 16 8 8 8 8 0 0 0 200 0 0 200 200 150 150 150 150 0 0 0 200 0 0 200 200 150 150 150 150 0 0 0 </values> </instantiation>