Name | StripPacking/ StripPacking-C1P1_c18.xml |
MD5SUM | 889218b6c90316b766a017c27e87ee44 |
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 | 2.87841 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 80 |
Number of constraints | 49 |
Number of domains | 18 |
Minimum domain size | 1 |
Maximum domain size | 20 |
Distribution of domain sizes | [{"size":1,"count":4},{"size":2,"count":44},{"size":20,"count":32}] |
Minimum variable degree | 1 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":1,"count":16},{"degree":2,"count":32},{"degree":3,"count":32}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 64 |
Distribution of constraint arities | [{"arity":2,"count":32},{"arity":3,"count":16},{"arity":64,"count":1}] |
Number of extensional constraints | 16 |
Number of intensional constraints | 32 |
Distribution of constraint types | [{"type":"extension","count":16},{"type":"intension","count":32},{"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] 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] w[0] w[1] w[2] w[3] w[4] w[5] w[6] w[7] w[8] w[9] w[10] w[11] w[12] w[13] w[14] w[15] h[0] h[1] h[2] h[3] h[4] h[5] h[6] h[7] h[8] h[9] h[10] h[11] h[12] h[13] h[14] h[15] r[0] r[1] r[2] r[3] r[4] r[5] r[6] r[7] r[8] r[9] r[10] r[11] r[12] r[13] r[14] r[15] </list> <values>16 0 12 5 0 11 0 0 5 5 3 3 12 12 18 18 0 10 12 0 7 0 17 0 5 3 4 0 9 5 11 0 2 12 6 6 5 5 12 3 7 6 2 2 4 4 2 2 12 7 8 3 3 5 3 7 5 2 3 4 3 4 9 11 0 1 1 1 1 0 1 0 1 1 1 1 1 0 1 1 </values> </instantiation>