| Name | TemplateDesign/ TemplateDesign-m2-1_c18.xml |
| MD5SUM | 03e8a75034815332807f603ddfd28107 |
| 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.07008 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 15 |
| Number of constraints | 13 |
| Number of domains | 3 |
| Minimum domain size | 2 |
| Maximum domain size | 801 |
| Distribution of domain sizes | [{"size":2,"count":3},{"size":5,"count":9},{"size":801,"count":3}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":6},{"degree":3,"count":6},{"degree":5,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":3,"count":4},{"arity":6,"count":3}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 6 |
| Distribution of constraint types | [{"type":"intension","count":6},{"type":"ordered","count":1},{"type":"sum","count":6}] |
| 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) | 4312633 | OPT | 2 | 0.007742 | 0.00845111 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301801 | OPT | 2 | 1.07008 | 0.542939 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312313 | OPT | 2 | 1.56511 | 1.04407 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310453 | OPT | 2 | 1.58052 | 1.04525 |
| Concrete 3.9.2-SuperNG (complete) | 4302827 | OPT | 2 | 7.98032 | 3.91021 |
| Concrete 3.9.2 (complete) | 4302477 | OPT | 2 | 8.04186 | 3.94638 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310103 | SAT | 2 | 250.506 | 247.363 |
| cosoco 1.12 (complete) | 4301803 | ? (TO) | 251.962 | 252.009 | |
| Sat4j-CSP 2018-07-11 (complete) | 4301802 | ? (TO) | 259.546 | 83.6524 |
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[1][0] d[1][1] d[1][2] d[2][0] d[2][1] d[2][2] npt[0] npt[1] npt[2] u[0] u[1] u[2] </list> <values> 0 1 3 2 2 0 4 0 0 254 119 0 1 1 0 </values> </instantiation>