Name | Langford/ LangfordBin-14_c18.xml |
MD5SUM | 907d87f313d4aa93f4a53d5ea17b135a |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 56 |
Number of constraints | 42 |
Number of domains | 2 |
Minimum domain size | 14 |
Maximum domain size | 28 |
Distribution of domain sizes | [{"size":14,"count":28},{"size":28,"count":28}] |
Minimum variable degree | 2 |
Maximum variable degree | 28 |
Distribution of variable degrees | [{"degree":2,"count":28},{"degree":28,"count":28}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 29 |
Distribution of constraint arities | [{"arity":2,"count":14},{"arity":29,"count":28}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 14 |
Distribution of constraint types | [{"type":"intension","count":14},{"type":"element","count":28}] |
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: