Name | Random/Random-D-t020/ rand-2-40-11-414-020-79.xml |
MD5SUM | c0f256b6b5f799b1206df7220afe38a7 |
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 | 31.3194 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 40 |
Number of constraints | 414 |
Number of domains | 1 |
Minimum domain size | 11 |
Maximum domain size | 11 |
Distribution of domain sizes | [{"size":11,"count":40}] |
Minimum variable degree | 14 |
Maximum variable degree | 26 |
Distribution of variable degrees | [{"degree":14,"count":1},{"degree":15,"count":1},{"degree":16,"count":1},{"degree":18,"count":6},{"degree":19,"count":4},{"degree":20,"count":5},{"degree":21,"count":6},{"degree":22,"count":6},{"degree":23,"count":5},{"degree":24,"count":1},{"degree":25,"count":2},{"degree":26,"count":2}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":414}] |
Number of extensional constraints | 414 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":414}] |
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: