| Name | PizzaVoucher/ PizzaVoucher-15b_c18.xml |
| MD5SUM | b017fe45b316a2eca4ba7804b3adba5f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 42 |
| Best CPU time to get the best result obtained on this benchmark | 20055.1 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 62 |
| Number of constraints | 163 |
| Number of domains | 19 |
| Minimum domain size | 1 |
| Maximum domain size | 33 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":36},{"size":3,"count":5},{"size":4,"count":2},{"size":5,"count":1},{"size":7,"count":1},{"size":33,"count":15}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 47 |
| Distribution of variable degrees | [{"degree":2,"count":47},{"degree":46,"count":10},{"degree":47,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":2,"count":131},{"arity":16,"count":32}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 131 |
| Distribution of constraint types | [{"type":"intension","count":131},{"type":"count","count":32}] |
| 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) | 4297480 | SAT (TO) | 42 | 20055.1 | 2520.09 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291067 | ? (TO) | 20011.7 | 2520.51 | |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308836 | ? (TO) | 20033.1 | 2520.7 |
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>v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] np[0] np[1] np[2] np[3] np[4] np[5] np[6] np[7] np[8] np[9] np[10] np[11] np[12] np[13] np[14] np[15] nf[0] nf[1] nf[2] nf[3] nf[4] nf[5] nf[6] nf[7] nf[8] nf[9] nf[10] nf[11] nf[12] nf[13] nf[14] nf[15] pp[0] pp[1] pp[2] pp[3] pp[4] pp[5] pp[6] pp[7] pp[8] pp[9] pp[10] pp[11] pp[12] pp[13] pp[14] </list> <values>-16 5 -15 15 15 -15 5 16 -5 3 15 3 15 -3 8 0 0 1 0 1 0 0 0 0 0 0 0 0 0 2 1 0 0 2 0 2 0 0 1 0 0 0 0 0 0 4 1 5 0 9 0 0 10 0 0 6 0 0 0 0 12 0 </values> </instantiation>