| Name | PizzaVoucher/ PizzaVoucher-10a_c18.xml |
| MD5SUM | a5c040ab978d2252c9b6b6d47e833d0a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 210 |
| Best CPU time to get the best result obtained on this benchmark | 4.34942 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 38 |
| Number of constraints | 82 |
| Number of domains | 17 |
| 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":28,"count":10}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":2,"count":64},{"arity":11,"count":18}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 64 |
| Distribution of constraint types | [{"type":"intension","count":64},{"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: 210<instantiation type="optimum" cost="210"> <list> v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] np[0] np[1] np[2] np[3] np[4] np[5] np[6] np[7] np[8] nf[0] nf[1] nf[2] nf[3] nf[4] nf[5] nf[6] nf[7] nf[8] pp[0] pp[1] pp[2] pp[3] pp[4] pp[5] pp[6] pp[7] pp[8] pp[9] </list> <values> -2 -2 -1 1 1 4 2 2 2 0 1 2 0 0 0 0 0 0 0 2 3 0 1 0 0 0 0 0 50 60 90 0 0 0 0 0 0 10 </values> </instantiation>