| Name | Random/Random-m1-5-8X-05c/ rand-5-8X-05c-44.xml |
| MD5SUM | 68fb7a5417760ab9cc88f495b9ce53b3 |
| 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 | 83.873 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 12 |
| Number of constraints | 95 |
| Number of domains | 1 |
| Minimum domain size | 12 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":12,"count":12}] |
| Minimum variable degree | 28 |
| Maximum variable degree | 48 |
| Distribution of variable degrees | [{"degree":28,"count":1},{"degree":34,"count":1},{"degree":35,"count":1},{"degree":37,"count":2},{"degree":38,"count":1},{"degree":41,"count":2},{"degree":44,"count":1},{"degree":45,"count":1},{"degree":47,"count":1},{"degree":48,"count":1}] |
| Minimum constraint arity | 5 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":5,"count":95}] |
| Number of extensional constraints | 95 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":95}] |
| 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: