| Name | SocialGolfers/ SocialGolfers-4-4-6-cp_c18.xml |
| MD5SUM | c46d03ece148f4d4d488319a25e0c2d7 |
| 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.371515 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 96 |
| Number of constraints | 1808 |
| Number of domains | 1 |
| Minimum domain size | 4 |
| Maximum domain size | 4 |
| Distribution of domain sizes | [{"size":4,"count":96}] |
| Minimum variable degree | 77 |
| Maximum variable degree | 78 |
| Distribution of variable degrees | [{"degree":77,"count":80},{"degree":78,"count":16}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 96 |
| Distribution of constraint arities | [{"arity":4,"count":1800},{"arity":16,"count":7},{"arity":96,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1800 |
| Distribution of constraint types | [{"type":"intension","count":1800},{"type":"lex","count":1},{"type":"cardinality","count":6},{"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: