| Name | Bibd/Bibd-sc-open/ Bibd-sc-85-085-36-36-15.xml |
| MD5SUM | 6283987435144a6b5e9cf918aca30279 |
| 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 | 621350 |
| Number of constraints | 307191 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":310675}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 87 |
| Distribution of variable degrees | [{"degree":0,"count":310675},{"degree":2,"count":303450},{"degree":87,"count":7225}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 7225 |
| Distribution of constraint arities | [{"arity":3,"count":303450},{"arity":85,"count":3740},{"arity":7225,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 303450 |
| Distribution of constraint types | [{"type":"intension","count":303450},{"type":"lex","count":1},{"type":"sum","count":3740}] |
| 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: