| Name | Langford/Langford-m2-s1/ LangfordBin-25.xml |
| MD5SUM | ff4f1513315dd8e08dcc4cf2bbbe3209 |
| 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 | 100 |
| Number of constraints | 75 |
| Number of domains | 2 |
| Minimum domain size | 25 |
| Maximum domain size | 50 |
| Distribution of domain sizes | [{"size":25,"count":50},{"size":50,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 50 |
| Distribution of variable degrees | [{"degree":2,"count":50},{"degree":50,"count":50}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 51 |
| Distribution of constraint arities | [{"arity":2,"count":25},{"arity":51,"count":50}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 25 |
| Distribution of constraint types | [{"type":"intension","count":25},{"type":"element","count":50}] |
| 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: