| Name | Quasigroups/ QuasiGroup-7-08_c18.xml |
| MD5SUM | f8c10a8313da5da6e599be620e9e581f |
| 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 | 1.55614 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 128 |
| Number of constraints | 114 |
| Number of domains | 1 |
| Minimum domain size | 8 |
| Maximum domain size | 8 |
| Distribution of domain sizes | [{"size":8,"count":120}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 17 |
| Distribution of variable degrees | [{"degree":0,"count":8},{"degree":2,"count":56},{"degree":16,"count":8},{"degree":17,"count":56}] |
| Minimum constraint arity | 8 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":8,"count":1},{"arity":10,"count":112},{"arity":64,"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":112}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: