Name | Quasigroups/ QuasiGroup-4-07_c18.xml |
MD5SUM | 3b77ed50ef14863a53905eb481969062 |
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.00629 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 98 |
Number of constraints | 86 |
Number of domains | 2 |
Minimum domain size | 7 |
Maximum domain size | 49 |
Distribution of domain sizes | [{"size":7,"count":49},{"size":49,"count":42}] |
Minimum variable degree | 0 |
Maximum variable degree | 45 |
Distribution of variable degrees | [{"degree":0,"count":7},{"degree":2,"count":42},{"degree":44,"count":7},{"degree":45,"count":42}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 50 |
Distribution of constraint arities | [{"arity":3,"count":42},{"arity":7,"count":1},{"arity":49,"count":1},{"arity":50,"count":42}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 42 |
Distribution of constraint types | [{"type":"intension","count":42},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":42}] |
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: