| Name | Bibd/ Bibd-sc-22-033-12-08-04_c18.xml |
| MD5SUM | 6ea47cf9d60ca9eef307247e67b78630 |
| 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 | 16698 |
| Number of constraints | 7910 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":8349}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 24 |
| Distribution of variable degrees | [{"degree":0,"count":8349},{"degree":2,"count":7623},{"degree":24,"count":726}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 726 |
| Distribution of constraint arities | [{"arity":3,"count":7623},{"arity":22,"count":33},{"arity":33,"count":253},{"arity":726,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 7623 |
| Distribution of constraint types | [{"type":"intension","count":7623},{"type":"lex","count":1},{"type":"sum","count":286}] |
| 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: