| Name | Bibd/Bibd-sum-open/ Bibd-sum-40-052-13-10-03.xml |
| MD5SUM | 2a84a2defac446a2567920a0781991b9 |
| 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 | 2080 |
| Number of constraints | 873 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":2080}] |
| Minimum variable degree | 42 |
| Maximum variable degree | 42 |
| Distribution of variable degrees | [{"degree":42,"count":2080}] |
| Minimum constraint arity | 40 |
| Maximum constraint arity | 2080 |
| Distribution of constraint arities | [{"arity":40,"count":52},{"arity":52,"count":40},{"arity":104,"count":780},{"arity":2080,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"lex","count":1},{"type":"sum","count":872}] |
| 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: