| Name | Random/Random-m1-5-12-12t/ rand-5-12-12-200-t85-6.xml |
| MD5SUM | 28aba8525a2c57af7de5748c3b9cdf6b |
| 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 | 14.7938 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 12 |
| Number of constraints | 200 |
| Number of domains | 1 |
| Minimum domain size | 12 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":12,"count":12}] |
| Minimum variable degree | 72 |
| Maximum variable degree | 102 |
| Distribution of variable degrees | [{"degree":72,"count":1},{"degree":76,"count":2},{"degree":79,"count":1},{"degree":82,"count":2},{"degree":83,"count":1},{"degree":85,"count":1},{"degree":86,"count":1},{"degree":88,"count":1},{"degree":89,"count":1},{"degree":102,"count":1}] |
| Minimum constraint arity | 5 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":5,"count":200}] |
| Number of extensional constraints | 200 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":200}] |
| 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: