| Name | PizzaVoucher/ PizzaVoucher-10b_c18.xml |
| MD5SUM | 2b2c64c71c05a1ba529c691595973c48 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 28 |
| Best CPU time to get the best result obtained on this benchmark | 9.32603 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 38 |
| Number of constraints | 79 |
| Number of domains | 14 |
| 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":27,"count":6},{"degree":28,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":2,"count":61},{"arity":11,"count":18}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 61 |
| Distribution of constraint types | [{"type":"intension","count":61},{"type":"count","count":18}] |
| 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) | 4301751 | OPT | 28 | 9.32603 | 7.49076 |
| Mistral-2.0 2018-08-01 (complete) | 4312616 | OPT | 28 | 19.7312 | 19.7307 |
| Concrete 3.9.2 (complete) | 4302378 | OPT | 28 | 56.1736 | 46.9443 |
| Concrete 3.9.2-SuperNG (complete) | 4302728 | OPT | 28 | 113.029 | 102.119 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301750 | OPT | 28 | 243.298 | 239.994 |
| cosoco 1.12 (complete) | 4301752 | SAT (TO) | 28 | 252.006 | 252.01 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312214 | SAT (TO) | 28 | 252.042 | 245.415 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310004 | SAT (TO) | 28 | 252.076 | 246.718 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310354 | SAT (TO) | 28 | 252.101 | 244.416 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 28<instantiation type="optimum" cost="28"> <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 -2 1 -1 0 2 -2 4 1 2 0 0 0 0 0 0 0 2 3 0 1 0 0 0 0 0 0 0 0 7 0 10 4 0 7 0 </values> </instantiation>