| Name | Bibd/ Bibd-sc-09-03-09_c18.xml |
| MD5SUM | 14461c5e126fcf4565f37d2e3313bad0 |
| 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 | 5.90115 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 9720 |
| Number of constraints | 4042 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":4860}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":0,"count":4860},{"degree":2,"count":3888},{"degree":11,"count":972}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 972 |
| Distribution of constraint arities | [{"arity":3,"count":3888},{"arity":9,"count":108},{"arity":108,"count":45},{"arity":972,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 3888 |
| Distribution of constraint types | [{"type":"intension","count":3888},{"type":"lex","count":1},{"type":"sum","count":153}] |
| 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--