| Name | LatinSquare/LatinSquare-xcsp2-qcp25/ qcp-25-264-12_X2.xml |
| MD5SUM | 0da6a8f2891de305d0b0efc67f372d88 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 3.28665 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 625 |
| Number of constraints | 15000 |
| Number of domains | 26 |
| Minimum domain size | 1 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":1,"count":361},{"size":25,"count":264}] |
| Minimum variable degree | 48 |
| Maximum variable degree | 48 |
| Distribution of variable degrees | [{"degree":48,"count":625}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":15000}] |
| Number of extensional constraints | 15000 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":15000}] |
| 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: