| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-154.xml |
| MD5SUM | 9c35d8cb8d03f0164c4f0b6ed4b5e670 |
| 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 | 369.492 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 53 |
| Number of domains | 1 |
| Minimum domain size | 524 |
| Maximum domain size | 524 |
| Distribution of domain sizes | [{"size":524,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":48},{"degree":3,"count":1},{"degree":4,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":1,"count":51},{"arity":2,"count":1},{"arity":50,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 52 |
| Distribution of constraint types | [{"type":"intension","count":52},{"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:<instantiation> <list> y[] x[] </list> <values> 383 392 200 383 404 200 220 321 383 145 159 321 437 145 159 220 235 392 257 383 0 0 220 360 0 380 380 125 359 359 90 389 125 305 90 365 164 305 0 426 125 0 392 389 164 0 365 226 0 145 </values> </instantiation>