| Name | SocialGolfers/ SocialGolfers-4-4-7-cp_c18.xml |
| MD5SUM | 6202e41c7df8f203e59ab292b28f5059 |
| 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 | 0.473528 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 112 |
| Number of constraints | 2529 |
| Number of domains | 1 |
| Minimum domain size | 4 |
| Maximum domain size | 4 |
| Distribution of domain sizes | [{"size":4,"count":112}] |
| Minimum variable degree | 92 |
| Maximum variable degree | 93 |
| Distribution of variable degrees | [{"degree":92,"count":96},{"degree":93,"count":16}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 112 |
| Distribution of constraint arities | [{"arity":4,"count":2520},{"arity":16,"count":8},{"arity":112,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 2520 |
| Distribution of constraint types | [{"type":"intension","count":2520},{"type":"lex","count":1},{"type":"cardinality","count":7},{"type":"instantiation","count":1}] |
| 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: