| Name | Knights/Knights-m1-s1/ Knights-015-09.xml |
| MD5SUM | cfe7c94c3eac37bc9c9baa094de7ccd9 |
| 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 | 0.089181 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 9 |
| Number of constraints | 36 |
| Number of domains | 1 |
| Minimum domain size | 225 |
| Maximum domain size | 225 |
| Distribution of domain sizes | [{"size":225,"count":9}] |
| Minimum variable degree | 7 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":7,"count":9}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":36}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 36 |
| Distribution of constraint types | [{"type":"intension","count":36}] |
| 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: