Name | QRandom/QRandom-bdd-18-21-2/ bdd-18-21-2-133-78-21.xml |
MD5SUM | c7982e61e1aa12db31c7a822b635a08f |
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 | 7.58339 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 21 |
Number of constraints | 133 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":21}] |
Minimum variable degree | 109 |
Maximum variable degree | 122 |
Distribution of variable degrees | [{"degree":109,"count":4},{"degree":110,"count":1},{"degree":112,"count":3},{"degree":113,"count":1},{"degree":114,"count":5},{"degree":115,"count":1},{"degree":116,"count":1},{"degree":117,"count":1},{"degree":118,"count":1},{"degree":120,"count":1},{"degree":121,"count":1},{"degree":122,"count":1}] |
Minimum constraint arity | 18 |
Maximum constraint arity | 18 |
Distribution of constraint arities | [{"arity":18,"count":133}] |
Number of extensional constraints | 133 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":133}] |
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: