| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-152.xml |
| MD5SUM | 95353c685d9c4a971cd57b59ef19ccd8 |
| 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 | 69.0695 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 53 |
| Number of domains | 1 |
| Minimum domain size | 513 |
| Maximum domain size | 513 |
| Distribution of domain sizes | [{"size":513,"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> 348 93 102 209 93 324 65 112 65 102 145 0 141 145 226 102 0 209 0 201 201 354 348 324 0 153 340 339 415 349 300 340 339 303 300 368 303 300 432 415 201 201 300 368 153 0 0 159 324 0 </values> </instantiation>