| Name | PizzaVoucher/ PizzaVoucher-12a_c18.xml |
| MD5SUM | 56cb9e23f693fb34c9078bf93399e92e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 40 |
| Best CPU time to get the best result obtained on this benchmark | 6.44458 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 44 |
| Number of constraints | 105 |
| Number of domains | 18 |
| Minimum domain size | 1 |
| Maximum domain size | 21 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":2,"count":24},{"size":3,"count":3},{"size":4,"count":2},{"size":5,"count":1},{"size":7,"count":1},{"size":21,"count":12}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 32 |
| Distribution of variable degrees | [{"degree":2,"count":32},{"degree":31,"count":6},{"degree":32,"count":6}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 13 |
| Distribution of constraint arities | [{"arity":2,"count":85},{"arity":13,"count":20}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 85 |
| Distribution of constraint types | [{"type":"intension","count":85},{"type":"count","count":20}] |
| 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: 40<instantiation type="optimum" cost="40"> <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] np[0] np[1] np[2] np[3] np[4] np[5] np[6] np[7] np[8] np[9] nf[0] nf[1] nf[2] nf[3] nf[4] nf[5] nf[6] nf[7] nf[8] nf[9] pp[0] pp[1] pp[2] pp[3] pp[4] pp[5] pp[6] pp[7] pp[8] pp[9] pp[10] pp[11] </list> <values> -1 9 9 9 -9 1 1 9 9 9 -9 -9 1 0 0 0 0 0 0 0 3 0 2 0 0 0 0 0 0 0 6 0 5 0 0 0 10 0 0 0 0 0 12 13 </values> </instantiation>