| Name | TemplateDesign/ TemplateDesign-m2-catfood_c18.xml |
| MD5SUM | 27271f0787f1d872c0f25c4abe418056 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 1.36772 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 63 |
| Number of constraints | 29 |
| Number of domains | 3 |
| Minimum domain size | 2 |
| Maximum domain size | 1101 |
| Distribution of domain sizes | [{"size":2,"count":7},{"size":10,"count":49},{"size":1101,"count":7}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":2,"count":42},{"degree":3,"count":14},{"degree":9,"count":7}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 14 |
| Distribution of constraint arities | [{"arity":2,"count":14},{"arity":7,"count":8},{"arity":14,"count":7}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 14 |
| Distribution of constraint types | [{"type":"intension","count":14},{"type":"ordered","count":1},{"type":"sum","count":14}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Mistral-2.0 2018-08-01 (complete) | 4312628 | OPT | 2 | 0.013902 | 0.014647 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301786 | OPT | 2 | 1.36772 | 0.626227 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310455 | OPT | 2 | 6.62543 | 4.43323 |
| Concrete 3.9.2-SuperNG (complete) | 4302829 | OPT | 2 | 11.7116 | 5.05917 |
| Concrete 3.9.2 (complete) | 4302479 | OPT | 2 | 14.4452 | 7.01945 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312315 | OPT | 2 | 15.9621 | 13.995 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310105 | SAT (TO) | 2 | 252.104 | 246.319 |
| cosoco 1.12 (complete) | 4301788 | ? (TO) | 252.009 | 252.01 | |
| Sat4j-CSP 2018-07-11 (complete) | 4301787 | ? (TO) | 259.914 | 88.442 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 2<instantiation type="optimum" cost="2"> <list> d[0][0] d[0][1] d[0][2] d[0][3] d[0][4] d[0][5] d[0][6] d[1][0] d[1][1] d[1][2] d[1][3] d[1][4] d[1][5] d[1][6] d[2][0] d[2][1] d[2][2] d[2][3] d[2][4] d[2][5] d[2][6] d[3][0] d[3][1] d[3][2] d[3][3] d[3][4] d[3][5] d[3][6] d[4][0] d[4][1] d[4][2] d[4][3] d[4][4] d[4][5] d[4][6] d[5][0] d[5][1] d[5][2] d[5][3] d[5][4] d[5][5] d[5][6] d[6][0] d[6][1] d[6][2] d[6][3] d[6][4] d[6][5] d[6][6] npt[0] npt[1] npt[2] npt[3] npt[4] npt[5] npt[6] u[0] u[1] u[2] u[3] u[4] u[5] u[6] </list> <values> 1 1 1 2 2 2 0 0 0 0 0 0 2 7 9 0 0 0 0 0 0 9 0 0 0 0 0 0 9 0 0 0 0 0 0 9 0 0 0 0 0 0 9 0 0 0 0 0 0 247 150 0 0 0 0 0 1 1 0 0 0 0 0 </values> </instantiation>