| Name | PizzaVoucher/ PizzaVoucher-15b_c18.xml |
| MD5SUM | b017fe45b316a2eca4ba7804b3adba5f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 42 |
| Best CPU time to get the best result obtained on this benchmark | 517.492 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 62 |
| Number of constraints | 163 |
| Number of domains | 19 |
| Minimum domain size | 1 |
| Maximum domain size | 33 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":36},{"size":3,"count":5},{"size":4,"count":2},{"size":5,"count":1},{"size":7,"count":1},{"size":33,"count":15}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 47 |
| Distribution of variable degrees | [{"degree":2,"count":47},{"degree":46,"count":10},{"degree":47,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":2,"count":131},{"arity":16,"count":32}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 131 |
| Distribution of constraint types | [{"type":"intension","count":131},{"type":"count","count":32}] |
| 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: 42<instantiation> <list> v[] pp[] nf[] np[] </list> <values> 6 -6 5 3 4 4 6 6 -6 5 3 -4 -3 -5 8 0 6 0 0 0 0 0 0 6 0 0 10 8 12 0 0 0 2 2 2 3 0 1 0 0 0 0 0 0 0 0 0 0 1 1 1 2 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>