| Name | PizzaVoucher/ PizzaVoucher-18a_c18.xml |
| MD5SUM | 3728d9c98e9ec51874bb5385faf79653 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 49 |
| Best CPU time to get the best result obtained on this benchmark | 1175.91 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 202 |
| Number of domains | 19 |
| Minimum domain size | 1 |
| Maximum domain size | 29 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":35},{"size":3,"count":4},{"size":4,"count":3},{"size":5,"count":1},{"size":7,"count":1},{"size":29,"count":18}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 46 |
| Distribution of variable degrees | [{"degree":2,"count":46},{"degree":44,"count":9},{"degree":45,"count":4},{"degree":46,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 19 |
| Distribution of constraint arities | [{"arity":2,"count":174},{"arity":19,"count":28}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 174 |
| Distribution of constraint types | [{"type":"intension","count":174},{"type":"count","count":28}] |
| 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: 49<instantiation> <list> pp[] nf[] np[] v[] </list> <values> 5 0 6 9 0 7 0 0 0 0 0 0 0 0 10 0 12 0 0 2 2 3 0 1 0 0 0 0 0 0 4 0 0 1 1 2 0 0 0 0 0 0 0 0 2 0 -4 4 -4 -13 13 -2 13 13 3 4 4 2 3 2 -13 13 -3 6 </values> </instantiation>