| Name | PizzaVoucher/ PizzaVoucher-12b_c18.xml |
| MD5SUM | 8890b3c4968b86b21e69352acb96ed82 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 40 |
| Best CPU time to get the best result obtained on this benchmark | 45.9169 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 48 |
| Number of constraints | 111 |
| Number of domains | 18 |
| Minimum domain size | 1 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":1,"count":1},{"size":2,"count":26},{"size":3,"count":5},{"size":4,"count":2},{"size":5,"count":1},{"size":7,"count":1},{"size":25,"count":12}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 36 |
| Distribution of variable degrees | [{"degree":2,"count":36},{"degree":35,"count":6},{"degree":36,"count":6}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 13 |
| Distribution of constraint arities | [{"arity":2,"count":87},{"arity":13,"count":24}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 87 |
| Distribution of constraint types | [{"type":"intension","count":87},{"type":"count","count":24}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297478 | OPT | 40 | 45.9169 | 6.75821 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291065 | ? (TO) | 20007.4 | 2520.45 | |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308834 | ? (TO) | 20015.9 | 2520.45 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 40<instantiation> <list>v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] np[0] np[1] np[2] np[3] np[4] np[5] np[6] np[7] np[8] np[9] np[10] np[11] nf[0] nf[1] nf[2] nf[3] nf[4] nf[5] nf[6] nf[7] nf[8] nf[9] nf[10] nf[11] pp[0] pp[1] pp[2] pp[3] pp[4] pp[5] pp[6] pp[7] pp[8] pp[9] pp[10] pp[11] </list> <values>1 11 11 11 11 1 -1 11 -11 11 -11 -11 1 0 0 0 0 0 0 0 0 0 3 0 2 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 5 0 10 0 12 13 </values> </instantiation>