| Name | LatinSquare/LatinSquare-m1-gs/ qwh-o100-h10000.xml |
| MD5SUM | 2d32aa9e5f9738deac3ebf02ed7c37b3 |
| 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 | 67.7052 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 10000 |
| Number of constraints | 1 |
| Number of domains | 1 |
| Minimum domain size | 100 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":100,"count":10000}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 1 |
| Distribution of variable degrees | [{"degree":1,"count":10000}] |
| Minimum constraint arity | 10000 |
| Maximum constraint arity | 10000 |
| Distribution of constraint arities | [{"arity":10000,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","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:--too large--