| Name | PizzaVoucher/ PizzaVoucher-15a_c18.xml |
| MD5SUM | a75ea741f9764b89989098c28f8006bf |
| 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 | 58.1377 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 56 |
| Number of constraints | 154 |
| Number of domains | 19 |
| Minimum domain size | 1 |
| Maximum domain size | 27 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":31},{"size":3,"count":4},{"size":4,"count":2},{"size":5,"count":1},{"size":7,"count":1},{"size":27,"count":15}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 41 |
| Distribution of variable degrees | [{"degree":2,"count":41},{"degree":40,"count":10},{"degree":41,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":2,"count":128},{"arity":16,"count":26}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 128 |
| Distribution of constraint types | [{"type":"intension","count":128},{"type":"count","count":26}] |
| 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> np[] v[] pp[] nf[] </list> <values> 1 1 0 0 0 0 0 0 0 0 0 2 1 12 12 2 12 -12 -2 13 -13 12 1 -12 1 2 -1 5 0 0 0 0 8 10 0 5 0 0 7 0 0 12 0 2 2 0 0 1 0 0 0 0 0 0 4 1 </values> </instantiation>