| Name | TemplateDesign/ TemplateDesign-m1s-2_c18.xml |
| MD5SUM | a795c17341a98acc8ee8963fc359ded0 |
| 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.42035 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 40 |
| Number of domains | 8 |
| Minimum domain size | 2 |
| Maximum domain size | 1210 |
| Distribution of domain sizes | [{"size":2,"count":5},{"size":7,"count":25},{"size":275,"count":5},{"size":286,"count":5},{"size":550,"count":5},{"size":880,"count":5},{"size":1101,"count":5},{"size":1210,"count":5}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":2,"count":55},{"degree":6,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":2,"count":5},{"arity":3,"count":25},{"arity":5,"count":10}] |
| Number of extensional constraints | 5 |
| Number of intensional constraints | 25 |
| Distribution of constraint types | [{"type":"extension","count":5},{"type":"intension","count":25},{"type":"sum","count":10}] |
| 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) | 4312623 | OPT | 2 | 0.022842 | 0.023574 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301771 | OPT | 2 | 1.42035 | 0.648863 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312309 | OPT | 2 | 2.08954 | 1.2391 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310449 | OPT | 2 | 2.09862 | 1.24206 |
| Concrete 3.9.2-SuperNG (complete) | 4302823 | OPT | 2 | 8.73845 | 4.13755 |
| Concrete 3.9.2 (complete) | 4302473 | OPT | 2 | 8.85078 | 4.24991 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310099 | SAT | 2 | 251.099 | 247.368 |
| cosoco 1.12 (complete) | 4301773 | SAT (TO) | 2 | 252.01 | 252.01 |
| Sat4j-CSP 2018-07-11 (complete) | 4301772 | ? (TO) | 260.352 | 86.47 |
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[1][0] d[1][1] d[1][2] d[1][3] d[1][4] d[2][0] d[2][1] d[2][2] d[2][3] d[2][4] d[3][0] d[3][1] d[3][2] d[3][3] d[3][4] d[4][0] d[4][1] d[4][2] d[4][3] d[4][4] npt[0] npt[1] npt[2] npt[3] npt[4] u[0] u[1] u[2] u[3] u[4] nptv[0][0] nptv[0][1] nptv[0][2] nptv[0][3] nptv[0][4] nptv[1][0] nptv[1][1] nptv[1][2] nptv[1][3] nptv[1][4] nptv[2][0] nptv[2][1] nptv[2][2] nptv[2][3] nptv[2][4] nptv[3][0] nptv[3][1] nptv[3][2] nptv[3][3] nptv[3][4] nptv[4][0] nptv[4][1] nptv[4][2] nptv[4][3] nptv[4][4] </list> <values> 0 0 6 0 0 0 0 0 0 6 6 0 0 0 0 2 2 1 1 0 0 0 1 2 3 0 0 0 124 351 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 248 248 124 124 0 0 0 351 702 1053 </values> </instantiation>