| Name | TemplateDesign/ TemplateDesign-m1s-catfood_c18.xml |
| MD5SUM | 03d7e3da755da5305422e48d51916754 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 1.6296 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 112 |
| Number of constraints | 70 |
| Number of domains | 9 |
| Minimum domain size | 2 |
| Maximum domain size | 1210 |
| Distribution of domain sizes | [{"size":2,"count":7},{"size":10,"count":49},{"size":275,"count":7},{"size":280,"count":7},{"size":286,"count":7},{"size":550,"count":14},{"size":880,"count":7},{"size":1101,"count":7},{"size":1210,"count":7}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":2,"count":105},{"degree":8,"count":7}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":2,"count":7},{"arity":3,"count":49},{"arity":7,"count":14}] |
| Number of extensional constraints | 7 |
| Number of intensional constraints | 49 |
| Distribution of constraint types | [{"type":"extension","count":7},{"type":"intension","count":49},{"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: 2<instantiation type="optimum" cost="2"> <list> d[0][0] d[0][1] d[0][2] d[0][3] d[0][4] d[0][5] d[0][6] d[1][0] d[1][1] d[1][2] d[1][3] d[1][4] d[1][5] d[1][6] d[2][0] d[2][1] d[2][2] d[2][3] d[2][4] d[2][5] d[2][6] d[3][0] d[3][1] d[3][2] d[3][3] d[3][4] d[3][5] d[3][6] d[4][0] d[4][1] d[4][2] d[4][3] d[4][4] d[4][5] d[4][6] d[5][0] d[5][1] d[5][2] d[5][3] d[5][4] d[5][5] d[5][6] d[6][0] d[6][1] d[6][2] d[6][3] d[6][4] d[6][5] d[6][6] npt[0] npt[1] npt[2] npt[3] npt[4] npt[5] npt[6] u[0] u[1] u[2] u[3] u[4] u[5] u[6] nptv[0][0] nptv[0][1] nptv[0][2] nptv[0][3] nptv[0][4] nptv[0][5] nptv[0][6] nptv[1][0] nptv[1][1] nptv[1][2] nptv[1][3] nptv[1][4] nptv[1][5] nptv[1][6] nptv[2][0] nptv[2][1] nptv[2][2] nptv[2][3] nptv[2][4] nptv[2][5] nptv[2][6] nptv[3][0] nptv[3][1] nptv[3][2] nptv[3][3] nptv[3][4] nptv[3][5] nptv[3][6] nptv[4][0] nptv[4][1] nptv[4][2] nptv[4][3] nptv[4][4] nptv[4][5] nptv[4][6] nptv[5][0] nptv[5][1] nptv[5][2] nptv[5][3] nptv[5][4] nptv[5][5] nptv[5][6] nptv[6][0] nptv[6][1] nptv[6][2] nptv[6][3] nptv[6][4] nptv[6][5] nptv[6][6] </list> <values> 0 0 0 0 0 0 9 0 0 0 0 9 0 0 9 0 0 0 0 0 0 0 0 0 0 0 9 0 9 0 0 0 0 0 0 1 1 1 2 2 2 0 0 0 0 0 0 2 7 0 0 0 0 0 247 150 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 247 247 247 494 494 494 0 0 0 0 0 0 300 1050 </values> </instantiation>