| Name | XCSP19/ConsecutiveSquarePacking/ ConsecutiveSquarePacking-sp-15-036.xml |
| MD5SUM | 5e5c63d89f6605b36f0577fcc9be8ecb |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 1.60869 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 105 |
| Number of domains | 15 |
| Minimum domain size | 22 |
| Maximum domain size | 36 |
| Distribution of domain sizes | [{"size":22,"count":2},{"size":23,"count":2},{"size":24,"count":2},{"size":25,"count":2},{"size":26,"count":2},{"size":27,"count":2},{"size":28,"count":2},{"size":29,"count":2},{"size":30,"count":2},{"size":31,"count":2},{"size":32,"count":2},{"size":33,"count":2},{"size":34,"count":2},{"size":35,"count":2},{"size":36,"count":2}] |
| Minimum variable degree | 14 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":14,"count":30}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 4 |
| Distribution of constraint arities | [{"arity":4,"count":105}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 105 |
| Distribution of constraint types | [{"type":"intension","count":105}] |
| 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:<instantiation type="solution"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] </list> <values> 0 22 22 9 9 29 29 14 0 25 25 0 12 0 14 12 13 15 32 27 21 27 13 27 11 0 0 0 13 21 </values> </instantiation>