| Name | PizzaVoucher/ PizzaVoucher-22a_c18.xml |
| MD5SUM | 40a5a96b8eb7bfbd368a4d559cc37ab9 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 61 |
| Best CPU time to get the best result obtained on this benchmark | 252.067 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 78 |
| Number of constraints | 284 |
| Number of domains | 19 |
| Minimum domain size | 1 |
| Maximum domain size | 35 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":43},{"size":3,"count":5},{"size":4,"count":4},{"size":5,"count":1},{"size":7,"count":1},{"size":35,"count":22}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 56 |
| Distribution of variable degrees | [{"degree":2,"count":56},{"degree":53,"count":8},{"degree":54,"count":6},{"degree":55,"count":4},{"degree":56,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 23 |
| Distribution of constraint arities | [{"arity":2,"count":250},{"arity":23,"count":34}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 250 |
| Distribution of constraint types | [{"type":"intension","count":250},{"type":"count","count":34}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Sat4j-CSP 2018-07-11 (complete) | 4301745 | SAT (TO) | 61 | 252.067 | 247.618 |
| Mistral-2.0 2018-08-01 (complete) | 4312614 | SAT (TO) | 62 | 251.981 | 252.01 |
| Concrete 3.9.2 (complete) | 4302385 | SAT (TO) | 63 | 252.055 | 237.238 |
| Concrete 3.9.2-SuperNG (complete) | 4302735 | SAT (TO) | 74 | 252.043 | 237.536 |
| cosoco 1.12 (complete) | 4301746 | ? (TO) | 251.985 | 252.01 | |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301744 | ? (TO) | 252.029 | 248.413 | |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310011 | ? (TO) | 252.105 | 246.617 | |
| OscaR - Hybrid 2018-08-14 (complete) | 4310361 | ? (TO) | 252.119 | 246.918 | |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312221 | ? (TO) | 252.136 | 245.986 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 61<instantiation type="solution"> <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] v[18] v[19] v[20] v[21] 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] np[16] 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] nf[16] 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] pp[18] pp[19] pp[20] pp[21] </list> <values> 14 -15 14 -14 15 14 -14 -5 15 15 5 -15 -14 14 14 14 4 15 4 5 8 -4 0 0 0 1 1 0 0 0 0 0 0 0 0 3 2 0 0 0 0 0 2 2 0 0 1 0 0 0 0 0 6 4 0 0 0 7 0 8 0 0 6 9 0 0 0 8 10 0 0 0 0 0 0 0 0 13 </values> </instantiation>