| Name | Quasigroups/ QuasiGroup-7-14_c18.xml |
| MD5SUM | 4dff686a8a5225f7abc28d59168fc0d9 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 392 |
| Number of constraints | 366 |
| Number of domains | 1 |
| Minimum domain size | 14 |
| Maximum domain size | 14 |
| Distribution of domain sizes | [{"size":14,"count":378}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 29 |
| Distribution of variable degrees | [{"degree":0,"count":14},{"degree":2,"count":182},{"degree":28,"count":14},{"degree":29,"count":182}] |
| Minimum constraint arity | 14 |
| Maximum constraint arity | 196 |
| Distribution of constraint arities | [{"arity":14,"count":1},{"arity":16,"count":364},{"arity":196,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":364}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291319 | ? (TO) | 19955.6 | 2520.36 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309088 | ? (TO) | 19975.1 | 2520.44 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307181 | ? (TO) | 20069.6 | 2520.07 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307417 | ? (TO) | 20070.6 | 2520.07 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297732 | ? (TO) | 20072.4 | 2520.12 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296997 | ? (TO) | 20076.2 | 2520.07 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297233 | ? (TO) | 20076.6 | 2520.06 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: