| Name | Quasigroups/ QuasiGroup-4-16_c18.xml |
| MD5SUM | e7fed86d91a4783730bc3bb5ac61f990 |
| 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 | 512 |
| Number of constraints | 482 |
| Number of domains | 2 |
| Minimum domain size | 16 |
| Maximum domain size | 256 |
| Distribution of domain sizes | [{"size":16,"count":256},{"size":256,"count":240}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 243 |
| Distribution of variable degrees | [{"degree":0,"count":16},{"degree":2,"count":240},{"degree":242,"count":16},{"degree":243,"count":240}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 257 |
| Distribution of constraint arities | [{"arity":3,"count":240},{"arity":16,"count":1},{"arity":256,"count":1},{"arity":257,"count":240}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 240 |
| Distribution of constraint types | [{"type":"intension","count":240},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":240}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309081 | ? (TO) | 19795.9 | 2520.29 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291312 | ? (TO) | 19799.6 | 2520.44 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307174 | ? (TO) | 20011.9 | 2520.08 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307410 | ? (TO) | 20017.7 | 2520.1 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296990 | ? (TO) | 20027.6 | 2520.22 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297226 | ? (TO) | 20028.1 | 2520.23 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297725 | ? (TO) | 20081.5 | 2520.12 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: