| Name | PizzaVoucher/ PizzaVoucher-12b_c18.xml |
| MD5SUM | 8890b3c4968b86b21e69352acb96ed82 |
| 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 | 8.12699 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 48 |
| Number of constraints | 111 |
| Number of domains | 18 |
| Minimum domain size | 1 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":2,"count":26},{"size":3,"count":5},{"size":4,"count":2},{"size":5,"count":1},{"size":7,"count":1},{"size":25,"count":12}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 36 |
| Distribution of variable degrees | [{"degree":2,"count":36},{"degree":35,"count":6},{"degree":36,"count":6}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 13 |
| Distribution of constraint arities | [{"arity":2,"count":87},{"arity":13,"count":24}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 87 |
| Distribution of constraint types | [{"type":"intension","count":87},{"type":"count","count":24}] |
| 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> <list> v[] np[] pp[] nf[] </list> <values> 1 11 11 11 11 1 -1 11 -11 11 -11 -11 1 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 5 0 10 0 12 13 2 0 0 0 0 0 0 0 0 0 6 0 </values> </instantiation>