| Name | Quasigroups/ QuasiGroup-7-20_c18.xml |
| MD5SUM | 5f66fd9d375fc47cd589a0d8fc089b8f |
| 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 | 800 |
| Number of constraints | 762 |
| Number of domains | 1 |
| Minimum domain size | 20 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":20,"count":780}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 41 |
| Distribution of variable degrees | [{"degree":0,"count":20},{"degree":2,"count":380},{"degree":40,"count":20},{"degree":41,"count":380}] |
| Minimum constraint arity | 20 |
| Maximum constraint arity | 400 |
| Distribution of constraint arities | [{"arity":20,"count":1},{"arity":22,"count":760},{"arity":400,"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":760}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291321 | ? (TO) | 19933.5 | 2520.34 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309090 | ? (TO) | 19946.6 | 2520.4 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307419 | ? (TO) | 20031.6 | 2520.16 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307183 | ? (TO) | 20033.4 | 2520.18 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297235 | ? (TO) | 20040.2 | 2520.14 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296999 | ? (TO) | 20040.5 | 2520.18 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297734 | ? (TO) | 20081.1 | 2520.11 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: