| Name | XCSP19/ConsecutiveSquarePacking/ ConsecutiveSquarePacking-sp-35-123.xml |
| MD5SUM | 45744cc354831d0c2f8e03e2f88be5e0 |
| 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 | 70 |
| Number of constraints | 595 |
| Number of domains | 35 |
| Minimum domain size | 89 |
| Maximum domain size | 123 |
| Distribution of domain sizes | [{"size":89,"count":2},{"size":90,"count":2},{"size":91,"count":2},{"size":92,"count":2},{"size":93,"count":2},{"size":94,"count":2},{"size":95,"count":2},{"size":96,"count":2},{"size":97,"count":2},{"size":98,"count":2},{"size":99,"count":2},{"size":100,"count":2},{"size":101,"count":2},{"size":102,"count":2},{"size":103,"count":2},{"size":104,"count":2},{"size":105,"count":2},{"size":106,"count":2},{"size":107,"count":2},{"size":108,"count":2},{"size":109,"count":2},{"size":110,"count":2},{"size":111,"count":2},{"size":112,"count":2},{"size":113,"count":2},{"size":114,"count":2},{"size":115,"count":2},{"size":116,"count":2},{"size":117,"count":2},{"size":118,"count":2},{"size":119,"count":2},{"size":120,"count":2},{"size":121,"count":2},{"size":122,"count":2},{"size":123,"count":2}] |
| Minimum variable degree | 34 |
| Maximum variable degree | 34 |
| Distribution of variable degrees | [{"degree":34,"count":70}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 4 |
| Distribution of constraint arities | [{"arity":4,"count":595}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 595 |
| Distribution of constraint types | [{"type":"intension","count":595}] |
| 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: