| Name | Bibd/Bibd-sc-stab2/ Bibd-sc-21-06-02.xml |
| MD5SUM | 6ee46be2b9080c76505f48a0e11d9ca8 |
| 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 | 12936 |
| Number of constraints | 6140 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":6468}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 23 |
| Distribution of variable degrees | [{"degree":0,"count":6468},{"degree":2,"count":5880},{"degree":23,"count":588}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 588 |
| Distribution of constraint arities | [{"arity":3,"count":5880},{"arity":21,"count":28},{"arity":28,"count":231},{"arity":588,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 5880 |
| Distribution of constraint types | [{"type":"intension","count":5880},{"type":"lex","count":1},{"type":"sum","count":259}] |
| 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: