Name | QRandom/QRandom-mdd-7-25-5-p7/ mdd-7-25-5-ps05-psh07-9.xml |
MD5SUM | 2d7f03e466d78847960dc3f747db29ef |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 42.4013 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 25 |
Number of constraints | 58 |
Number of domains | 1 |
Minimum domain size | 5 |
Maximum domain size | 5 |
Distribution of domain sizes | [{"size":5,"count":25}] |
Minimum variable degree | 12 |
Maximum variable degree | 25 |
Distribution of variable degrees | [{"degree":12,"count":1},{"degree":13,"count":3},{"degree":14,"count":6},{"degree":15,"count":2},{"degree":16,"count":3},{"degree":17,"count":4},{"degree":18,"count":1},{"degree":19,"count":1},{"degree":20,"count":2},{"degree":23,"count":1},{"degree":25,"count":1}] |
Minimum constraint arity | 7 |
Maximum constraint arity | 7 |
Distribution of constraint arities | [{"arity":7,"count":58}] |
Number of extensional constraints | 58 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":58}] |
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: