| Name | SocialGolfers/SocialGolfers-cp-s1/ SocialGolfers-5-3-4-cp.xml |
| MD5SUM | fefd0dc8744a7f984307705d377cf1e3 |
| 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.123382 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 636 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":60}] |
| Minimum variable degree | 44 |
| Maximum variable degree | 45 |
| Distribution of variable degrees | [{"degree":44,"count":45},{"degree":45,"count":15}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 60 |
| Distribution of constraint arities | [{"arity":4,"count":630},{"arity":15,"count":5},{"arity":60,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 630 |
| Distribution of constraint types | [{"type":"intension","count":630},{"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 1 1 1 2 2 2 3 3 3 4 4 4 0 3 4 0 2 3 0 1 2 1 3 4 1 2 4 1 3 0 4 0 2 2 0 3 1 4 3 2 1 4 3 4 0 1 2 0 2 1 3 4 2 1 3 0 4 </values> </instantiation>