| Name | SocialGolfers/ SocialGolfers-4-4-4-cp_c18.xml |
| MD5SUM | 323265c27f21e70af41ff0037033f3ab |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.168527 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 726 |
| Number of domains | 1 |
| Minimum domain size | 4 |
| Maximum domain size | 4 |
| Distribution of domain sizes | [{"size":4,"count":64}] |
| Minimum variable degree | 47 |
| Maximum variable degree | 48 |
| Distribution of variable degrees | [{"degree":47,"count":48},{"degree":48,"count":16}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":4,"count":720},{"arity":16,"count":5},{"arity":64,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 720 |
| Distribution of constraint types | [{"type":"intension","count":720},{"type":"lex","count":1},{"type":"cardinality","count":4},{"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:<instantiation> <list> x[][] </list> <values> 0 0 0 0 1 1 1 1 2 2 2 2 3 3 3 3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3 3 1 0 2 0 2 3 1 1 3 2 0 2 0 1 3 3 1 2 0 0 2 1 3 2 0 3 1 1 3 0 2 </values> </instantiation>