| Name | Bibd/Bibd-sc-stab1/ Bibd-sc-25-09-03.xml |
| MD5SUM | b322a6ca95a6b4f2599adbb58d93a3a3 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 137.506 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 16250 |
| Number of constraints | 7851 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":8125}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 27 |
| Distribution of variable degrees | [{"degree":0,"count":8125},{"degree":2,"count":7500},{"degree":27,"count":625}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 625 |
| Distribution of constraint arities | [{"arity":3,"count":7500},{"arity":25,"count":350},{"arity":625,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 7500 |
| Distribution of constraint types | [{"type":"intension","count":7500},{"type":"lex","count":1},{"type":"sum","count":350}] |
| 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:--too large--