| Name | TemplateDesign/ TemplateDesign-m1-1_c18.xml |
| MD5SUM | 3db83836fd15e943f67e7808e5ced101 |
| 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 | 0.242697 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 24 |
| Number of constraints | 22 |
| Number of domains | 6 |
| Minimum domain size | 2 |
| Maximum domain size | 880 |
| Distribution of domain sizes | [{"size":2,"count":3},{"size":5,"count":9},{"size":275,"count":3},{"size":550,"count":3},{"size":801,"count":3},{"size":880,"count":3}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":15},{"degree":3,"count":6},{"degree":5,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":3,"count":16}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 15 |
| Distribution of constraint types | [{"type":"intension","count":15},{"type":"ordered","count":1},{"type":"sum","count":6}] |
| 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[1][0] d[1][1] d[1][2] d[2][0] d[2][1] d[2][2] npt[0] npt[1] npt[2] u[0] u[1] u[2] nptv[0][0] nptv[0][1] nptv[0][2] nptv[1][0] nptv[1][1] nptv[1][2] nptv[2][0] nptv[2][1] nptv[2][2] </list> <values> 0 1 3 2 2 0 4 0 0 254 119 0 1 1 0 0 254 762 238 238 0 0 0 0 </values> </instantiation>