Name | Quasigroups/ QuasiGroup-4-08_c18.xml |
MD5SUM | 86261698a40453ca60d699c1ebc214eb |
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 | 30.4561 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 128 |
Number of constraints | 114 |
Number of domains | 2 |
Minimum domain size | 8 |
Maximum domain size | 64 |
Distribution of domain sizes | [{"size":8,"count":64},{"size":64,"count":56}] |
Minimum variable degree | 0 |
Maximum variable degree | 59 |
Distribution of variable degrees | [{"degree":0,"count":8},{"degree":2,"count":56},{"degree":58,"count":8},{"degree":59,"count":56}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 65 |
Distribution of constraint arities | [{"arity":3,"count":56},{"arity":8,"count":1},{"arity":64,"count":1},{"arity":65,"count":56}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 56 |
Distribution of constraint types | [{"type":"intension","count":56},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":56}] |
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: