| Name | PizzaVoucher/ PizzaVoucher-10b_c18.xml |
| MD5SUM | 2b2c64c71c05a1ba529c691595973c48 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 28 |
| Best CPU time to get the best result obtained on this benchmark | 5.22787 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 38 |
| Number of constraints | 79 |
| Number of domains | 14 |
| Minimum domain size | 1 |
| Maximum domain size | 19 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":21},{"size":3,"count":3},{"size":4,"count":2},{"size":19,"count":10}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 28 |
| Distribution of variable degrees | [{"degree":2,"count":28},{"degree":27,"count":6},{"degree":28,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":2,"count":61},{"arity":11,"count":18}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 61 |
| Distribution of constraint types | [{"type":"intension","count":61},{"type":"count","count":18}] |
| 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: 28<instantiation> <list> nf[] np[] v[] pp[] </list> <values> 2 3 0 1 0 0 0 0 0 1 2 0 0 0 0 0 0 0 2 2 1 -2 4 1 0 2 -2 -1 0 0 0 7 0 0 4 0 7 10 </values> </instantiation>