| Name | Quasigroups/ QuasiGroup-7-07_c18.xml |
| MD5SUM | 950a11acbe9bee1dbcb0d00f57370eba |
| 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 | 0.287109 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 98 |
| Number of constraints | 86 |
| Number of domains | 1 |
| Minimum domain size | 7 |
| Maximum domain size | 7 |
| Distribution of domain sizes | [{"size":7,"count":91}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 15 |
| Distribution of variable degrees | [{"degree":0,"count":7},{"degree":2,"count":42},{"degree":14,"count":7},{"degree":15,"count":42}] |
| Minimum constraint arity | 7 |
| Maximum constraint arity | 49 |
| Distribution of constraint arities | [{"arity":7,"count":1},{"arity":9,"count":84},{"arity":49,"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":84}] |
| 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: