Name | Random/Random-m1-7-40-8t/ rand-7-40-8-40-22500-0.xml |
MD5SUM | bec643ae272751fbe4415f184f63255d |
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 | 64.9451 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 40 |
Number of constraints | 40 |
Number of domains | 1 |
Minimum domain size | 8 |
Maximum domain size | 8 |
Distribution of domain sizes | [{"size":8,"count":40}] |
Minimum variable degree | 2 |
Maximum variable degree | 14 |
Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":4},{"degree":4,"count":2},{"degree":5,"count":1},{"degree":6,"count":8},{"degree":7,"count":8},{"degree":8,"count":8},{"degree":9,"count":4},{"degree":11,"count":2},{"degree":13,"count":1},{"degree":14,"count":1}] |
Minimum constraint arity | 7 |
Maximum constraint arity | 7 |
Distribution of constraint arities | [{"arity":7,"count":40}] |
Number of extensional constraints | 40 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":40}] |
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: