| Name | SocialGolfers/SocialGolfers-cp-s1/ SocialGolfers-8-9-9-cp.xml |
| MD5SUM | 7f38f9e4cc6c9387b3de2b1a6255283e |
| 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 | 27.2146 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 648 |
| Number of constraints | 92027 |
| Number of domains | 1 |
| Minimum domain size | 8 |
| Maximum domain size | 8 |
| Distribution of domain sizes | [{"size":8,"count":648}] |
| Minimum variable degree | 570 |
| Maximum variable degree | 571 |
| Distribution of variable degrees | [{"degree":570,"count":576},{"degree":571,"count":72}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 648 |
| Distribution of constraint arities | [{"arity":4,"count":92016},{"arity":72,"count":10},{"arity":648,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 92016 |
| Distribution of constraint types | [{"type":"intension","count":92016},{"type":"lex","count":1},{"type":"cardinality","count":9},{"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: