| Name | SocialGolfers/ SocialGolfers-5-5-5-cp_c18.xml |
| MD5SUM | 01658bc7723d571de51995bec243d654 |
| 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 | 1.23379 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 125 |
| Number of constraints | 3007 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":125}] |
| Minimum variable degree | 98 |
| Maximum variable degree | 99 |
| Distribution of variable degrees | [{"degree":98,"count":100},{"degree":99,"count":25}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 125 |
| Distribution of constraint arities | [{"arity":4,"count":3000},{"arity":25,"count":6},{"arity":125,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 3000 |
| Distribution of constraint types | [{"type":"intension","count":3000},{"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 0 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 2 1 4 3 0 3 0 1 4 2 4 2 0 1 3 1 3 2 0 4 0 4 3 2 1 2 4 0 1 3 3 0 1 2 4 4 1 2 3 0 0 2 3 4 1 1 3 4 0 2 2 4 3 1 0 4 1 2 0 3 1 0 4 3 2 0 3 1 2 4 3 2 0 4 1 </values> </instantiation>