| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-203.xml |
| MD5SUM | ce251f4c9ae0df3aa97e9296eb89cd68 |
| 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 | 141.487 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 53 |
| Number of domains | 1 |
| Minimum domain size | 634 |
| Maximum domain size | 634 |
| Distribution of domain sizes | [{"size":634,"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> 234 292 318 292 309 249 309 353 342 249 399 161 239 318 161 353 234 239 0 462 234 407 0 399 0 327 265 241 239 265 239 298 407 241 282 235 327 160 160 239 298 342 0 239 235 461 407 400 0 0 </values> </instantiation>