| Name | PizzaVoucher/ PizzaVoucher-18a_c18.xml |
| MD5SUM | 3728d9c98e9ec51874bb5385faf79653 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 49 |
| Best CPU time to get the best result obtained on this benchmark | 20046 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 202 |
| Number of domains | 19 |
| Minimum domain size | 1 |
| Maximum domain size | 29 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":35},{"size":3,"count":4},{"size":4,"count":3},{"size":5,"count":1},{"size":7,"count":1},{"size":29,"count":18}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 46 |
| Distribution of variable degrees | [{"degree":2,"count":46},{"degree":44,"count":9},{"degree":45,"count":4},{"degree":46,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 19 |
| Distribution of constraint arities | [{"arity":2,"count":174},{"arity":19,"count":28}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 174 |
| Distribution of constraint types | [{"type":"intension","count":174},{"type":"count","count":28}] |
| 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) | 4297481 | SAT (TO) | 49 | 20046 | 2520.1 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291068 | ? (TO) | 19964.1 | 2520.51 | |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308837 | ? (TO) | 19990.1 | 2520.31 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 49<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] v[15] v[16] v[17] 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] 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] 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] pp[15] pp[16] pp[17] </list> <values>4 4 -4 2 13 13 3 -13 2 4 -4 13 3 13 -2 -13 -3 6 0 1 1 2 0 0 0 0 0 0 0 0 2 0 0 2 2 3 0 1 0 0 0 0 0 0 4 0 0 0 6 0 0 0 0 8 0 0 5 0 0 0 10 8 12 0 </values> </instantiation>