| Name | SocialGolfers/ SocialGolfers-5-5-8-cp_c18.xml |
| MD5SUM | 9b78f23c985b0ab0793e8fc03cc65dc7 |
| 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 | 7.37111 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 200 |
| Number of constraints | 8410 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":200}] |
| Minimum variable degree | 170 |
| Maximum variable degree | 171 |
| Distribution of variable degrees | [{"degree":170,"count":175},{"degree":171,"count":25}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 200 |
| Distribution of constraint arities | [{"arity":4,"count":8400},{"arity":25,"count":9},{"arity":200,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 8400 |
| Distribution of constraint types | [{"type":"intension","count":8400},{"type":"lex","count":1},{"type":"cardinality","count":8},{"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: