| Name | TemplateDesign/ TemplateDesign-m2-2_c18.xml |
| MD5SUM | 44fbe0987cd748884024830a876a5560 |
| 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.21947 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 35 |
| Number of constraints | 21 |
| Number of domains | 3 |
| Minimum domain size | 2 |
| Maximum domain size | 1101 |
| Distribution of domain sizes | [{"size":2,"count":5},{"size":7,"count":25},{"size":1101,"count":5}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":2,"count":20},{"degree":3,"count":10},{"degree":7,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":2,"count":10},{"arity":5,"count":6},{"arity":10,"count":5}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 10 |
| Distribution of constraint types | [{"type":"intension","count":10},{"type":"ordered","count":1},{"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) | 4312629 | OPT | 2 | 0.010932 | 0.0112749 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301789 | OPT | 2 | 1.21947 | 0.594094 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312314 | OPT | 2 | 1.61784 | 1.07276 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310454 | OPT | 2 | 1.83519 | 1.12562 |
| Concrete 3.9.2 (complete) | 4302478 | OPT | 2 | 9.32707 | 4.31048 |
| Concrete 3.9.2-SuperNG (complete) | 4302828 | OPT | 2 | 9.37679 | 4.51914 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310104 | SAT | 2 | 251.408 | 247.369 |
| cosoco 1.12 (complete) | 4301791 | ? (TO) | 251.997 | 252.01 | |
| Sat4j-CSP 2018-07-11 (complete) | 4301790 | ? (TO) | 259.991 | 89.5514 |
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] </list> <values> 0 1 2 3 0 1 0 0 0 5 6 0 0 0 0 6 0 0 0 0 6 0 0 0 0 254 238 0 0 0 1 1 0 0 0 </values> </instantiation>