| Name | StripPacking/StripPacking-m1-seriesT/ StripPacking-T5c.xml |
| MD5SUM | 3657d2b4866232829f5e159967af0f72 |
| 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 | 365 |
| Number of constraints | 220 |
| Number of domains | 75 |
| Minimum domain size | 1 |
| Maximum domain size | 200 |
| Distribution of domain sizes | [{"size":1,"count":6},{"size":2,"count":213},{"size":200,"count":146}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":73},{"degree":2,"count":146},{"degree":3,"count":146}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 292 |
| Distribution of constraint arities | [{"arity":2,"count":146},{"arity":3,"count":73},{"arity":292,"count":1}] |
| Number of extensional constraints | 73 |
| Number of intensional constraints | 146 |
| Distribution of constraint types | [{"type":"extension","count":73},{"type":"intension","count":146},{"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: