| Name | Quasigroups/ QuasiGroup-7-10_c18.xml |
| MD5SUM | 527aaa9849fb01578545f5f3ea53e2c8 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 4035.81 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 200 |
| Number of constraints | 182 |
| Number of domains | 1 |
| Minimum domain size | 10 |
| Maximum domain size | 10 |
| Distribution of domain sizes | [{"size":10,"count":190}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 21 |
| Distribution of variable degrees | [{"degree":0,"count":10},{"degree":2,"count":90},{"degree":20,"count":10},{"degree":21,"count":90}] |
| Minimum constraint arity | 10 |
| Maximum constraint arity | 100 |
| Distribution of constraint arities | [{"arity":10,"count":1},{"arity":12,"count":180},{"arity":100,"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":180}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop order+glucose-syrup (2018-07-07) (complete) | 4296995 | UNSAT | 4035.81 | 507.8 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307415 | UNSAT | 4309.94 | 542.947 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307179 | UNSAT | 4749.22 | 597.927 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297231 | UNSAT | 5835.51 | 733.436 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291317 | ? (TO) | 19940.3 | 2520.23 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309086 | ? (TO) | 19954 | 2520.51 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297730 | ? (TO) | 20072.9 | 2520.1 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: