Name | Langford/ LangfordBin-09_c18.xml |
MD5SUM | af6539439e5a66b9d4cb5cb754e7ed18 |
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.00891 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 36 |
Number of constraints | 27 |
Number of domains | 2 |
Minimum domain size | 9 |
Maximum domain size | 18 |
Distribution of domain sizes | [{"size":9,"count":18},{"size":18,"count":18}] |
Minimum variable degree | 2 |
Maximum variable degree | 18 |
Distribution of variable degrees | [{"degree":2,"count":18},{"degree":18,"count":18}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 19 |
Distribution of constraint arities | [{"arity":2,"count":9},{"arity":19,"count":18}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 9 |
Distribution of constraint types | [{"type":"intension","count":9},{"type":"element","count":18}] |
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: