Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-097.xml |
MD5SUM | 8967691277ed469002b27945208c5243 |
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 | 53.043 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 50 |
Number of constraints | 53 |
Number of domains | 1 |
Minimum domain size | 336 |
Maximum domain size | 336 |
Distribution of domain sizes | [{"size":336,"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>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] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] 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] y[15] y[16] y[17] y[18] y[19] y[20] y[21] y[22] y[23] y[24]</list> <values>224 105 101 101 176 108 118 101 79 105 73 226 224 184 73 176 79 118 0 262 0 132 226 184 0 190 253 253 246 184 246 242 229 257 256 229 190 152 152 184 192 283 184 184 152 257 242 226 0 0</values> </instantiation>