Name | PizzaVoucher/ PizzaVoucher-22b_c18.xml |
MD5SUM | 7375a72c51daab431b80fe15fe0b37d4 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 54 |
Best CPU time to get the best result obtained on this benchmark | 2400.26 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 86 |
Number of constraints | 296 |
Number of domains | 19 |
Minimum domain size | 1 |
Maximum domain size | 43 |
Distribution of domain sizes | [{"size":1,"count":3},{"size":2,"count":49},{"size":3,"count":6},{"size":4,"count":4},{"size":5,"count":1},{"size":7,"count":1},{"size":43,"count":22}] |
Minimum variable degree | 2 |
Maximum variable degree | 64 |
Distribution of variable degrees | [{"degree":2,"count":64},{"degree":61,"count":8},{"degree":62,"count":6},{"degree":63,"count":4},{"degree":64,"count":4}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 23 |
Distribution of constraint arities | [{"arity":2,"count":254},{"arity":23,"count":42}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 254 |
Distribution of constraint types | [{"type":"intension","count":254},{"type":"count","count":42}] |
Optimization problem | YES |
Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 54<instantiation type="solution"> <list> v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] v[15] v[16] v[17] v[18] v[19] v[20] v[21] np[0] np[1] np[2] np[3] np[4] np[5] np[6] np[7] np[8] np[9] np[10] np[11] np[12] np[13] np[14] np[15] np[16] np[17] np[18] np[19] np[20] nf[0] nf[1] nf[2] nf[3] nf[4] nf[5] nf[6] nf[7] nf[8] nf[9] nf[10] nf[11] nf[12] nf[13] nf[14] nf[15] nf[16] nf[17] nf[18] nf[19] nf[20] pp[0] pp[1] pp[2] pp[3] pp[4] pp[5] pp[6] pp[7] pp[8] pp[9] pp[10] pp[11] pp[12] pp[13] pp[14] pp[15] pp[16] pp[17] pp[18] pp[19] pp[20] pp[21] </list> <values> 19 18 19 18 19 -9 -19 8 18 18 18 -18 8 9 9 -19 -8 18 -18 -18 1 12 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 3 2 0 0 1 0 0 0 0 0 0 2 2 0 0 1 0 0 0 0 0 6 3 0 0 0 0 0 0 0 5 6 0 0 0 0 8 0 0 0 6 11 0 10 8 0 0 </values> </instantiation>