Name | Bibd/ Bibd-sc-34-085-30-12-10_c18.xml |
MD5SUM | 16a7a800d3f63e1acf189b42778a783a |
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 | 101150 |
Number of constraints | 48366 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":50575}] |
Minimum variable degree | 0 |
Maximum variable degree | 36 |
Distribution of variable degrees | [{"degree":0,"count":50575},{"degree":2,"count":47685},{"degree":36,"count":2890}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 2890 |
Distribution of constraint arities | [{"arity":3,"count":47685},{"arity":34,"count":85},{"arity":85,"count":595},{"arity":2890,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 47685 |
Distribution of constraint types | [{"type":"intension","count":47685},{"type":"lex","count":1},{"type":"sum","count":680}] |
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: