| Name | SocialGolfers/SocialGolfers-cp-s1/ SocialGolfers-9-7-4-cp.xml |
| MD5SUM | 6c7c8fee2fac051830782d16440ff60b |
| 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 | 16.8668 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 252 |
| Number of constraints | 11724 |
| Number of domains | 1 |
| Minimum domain size | 9 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":9,"count":252}] |
| Minimum variable degree | 188 |
| Maximum variable degree | 189 |
| Distribution of variable degrees | [{"degree":188,"count":189},{"degree":189,"count":63}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 252 |
| Distribution of constraint arities | [{"arity":4,"count":11718},{"arity":63,"count":5},{"arity":252,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 11718 |
| Distribution of constraint types | [{"type":"intension","count":11718},{"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 0 0 0 1 1 1 1 1 1 1 2 2 2 2 2 2 2 3 3 3 3 3 3 3 4 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 6 6 6 7 7 7 7 7 7 7 8 8 8 8 8 8 8 0 1 2 3 4 5 6 1 2 3 5 6 7 8 0 2 4 5 6 7 8 0 1 3 4 5 7 8 0 1 2 3 4 7 8 0 2 4 5 6 7 8 0 1 2 3 5 6 7 1 2 3 4 6 7 8 0 1 3 4 5 6 8 7 8 0 5 6 3 4 5 4 2 8 6 3 1 4 6 0 2 5 1 8 5 0 3 1 6 7 4 0 1 8 7 3 2 5 1 2 4 7 0 8 6 2 3 5 1 0 7 6 6 7 0 2 8 4 3 3 2 4 8 5 1 7 8 3 0 4 5 1 6 1 7 2 0 4 3 8 5 1 6 7 0 4 2 7 4 6 0 3 5 1 2 7 5 1 8 6 3 6 8 4 2 3 1 0 1 0 2 3 5 7 8 6 4 7 3 8 2 5 4 5 0 7 8 2 6 </values> </instantiation>