| Name | SocialGolfers/ SocialGolfers-4-4-5-cp_c18.xml |
| MD5SUM | 9520b1c3a7fc9338271b16f0cb9e04b3 |
| 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.255241 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 80 |
| Number of constraints | 1207 |
| Number of domains | 1 |
| Minimum domain size | 4 |
| Maximum domain size | 4 |
| Distribution of domain sizes | [{"size":4,"count":80}] |
| Minimum variable degree | 62 |
| Maximum variable degree | 63 |
| Distribution of variable degrees | [{"degree":62,"count":64},{"degree":63,"count":16}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 80 |
| Distribution of constraint arities | [{"arity":4,"count":1200},{"arity":16,"count":6},{"arity":80,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1200 |
| Distribution of constraint types | [{"type":"intension","count":1200},{"type":"lex","count":1},{"type":"cardinality","count":5},{"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 0 3 1 2 1 2 0 3 3 0 2 1 2 1 3 0 0 3 2 1 1 2 3 0 2 1 0 3 3 0 1 2 2 0 3 1 0 2 1 3 1 3 0 2 3 1 2 0 </values> </instantiation>