| Name | SocialGolfers/SocialGolfers-cp-s1/ SocialGolfers-8-5-6-cp.xml |
| MD5SUM | 962a3bb05468dad13eb0bc1115b999f0 |
| 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 | 40.322 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 240 |
| Number of constraints | 11708 |
| Number of domains | 1 |
| Minimum domain size | 8 |
| Maximum domain size | 8 |
| Distribution of domain sizes | [{"size":8,"count":240}] |
| Minimum variable degree | 197 |
| Maximum variable degree | 198 |
| Distribution of variable degrees | [{"degree":197,"count":200},{"degree":198,"count":40}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 240 |
| Distribution of constraint arities | [{"arity":4,"count":11700},{"arity":40,"count":7},{"arity":240,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 11700 |
| Distribution of constraint types | [{"type":"intension","count":11700},{"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:<instantiation> <list> x[][] </list> <values> 0 0 0 0 0 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 6 6 6 6 6 7 7 7 7 7 2 4 5 6 7 0 1 3 5 7 0 1 2 3 4 0 2 3 4 6 1 3 4 6 7 0 1 2 5 7 1 2 5 6 7 0 3 4 5 6 2 7 5 4 6 1 6 0 2 3 0 2 1 4 5 6 7 3 1 5 1 2 0 3 5 3 7 0 4 1 3 4 7 6 2 5 7 4 6 0 3 0 5 7 2 1 6 3 0 5 5 2 0 1 6 7 4 6 2 3 3 5 4 2 1 0 1 7 2 4 4 6 3 0 7 4 7 5 1 6 3 6 5 0 1 1 4 7 2 3 0 5 4 2 7 7 2 1 0 6 2 6 4 7 0 5 3 6 4 7 0 5 1 3 4 3 5 1 6 2 7 4 0 3 5 2 7 0 1 4 1 3 5 6 2 4 2 3 0 1 4 5 3 6 7 7 0 6 2 1 5 4 6 2 0 6 1 7 3 5 </values> </instantiation>