| Name | StripPacking/StripPacking-m1-seriesN/ StripPacking-N6d.xml |
| MD5SUM | 2c28ca4ad49bcbb6099e9194469961d5 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 485 |
| Number of constraints | 292 |
| Number of domains | 97 |
| Minimum domain size | 1 |
| Maximum domain size | 200 |
| Distribution of domain sizes | [{"size":1,"count":8},{"size":2,"count":283},{"size":200,"count":194}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":97},{"degree":2,"count":194},{"degree":3,"count":194}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 388 |
| Distribution of constraint arities | [{"arity":2,"count":194},{"arity":3,"count":97},{"arity":388,"count":1}] |
| Number of extensional constraints | 97 |
| Number of intensional constraints | 194 |
| Distribution of constraint types | [{"type":"extension","count":97},{"type":"intension","count":194},{"type":"noOverlap","count":1}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: