| Name | Blackhole/Blackhole-xcsp2-s07/ Blackhole-4-07-8_X2.xml |
| MD5SUM | 5c0d10b65067a89bbe36375c556425e1 |
| 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 | 166.47 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 112 |
| Number of constraints | 1262 |
| Number of domains | 4 |
| Minimum domain size | 1 |
| Maximum domain size | 28 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":7,"count":28},{"size":14,"count":27},{"size":28,"count":54}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 56 |
| Distribution of variable degrees | [{"degree":0,"count":1},{"degree":2,"count":29},{"degree":3,"count":26},{"degree":28,"count":1},{"degree":29,"count":18},{"degree":30,"count":9},{"degree":56,"count":28}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":1262}] |
| Number of extensional constraints | 1262 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":1262}] |
| 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: