| Name | QueensKnights/QueensKnights-m1-s1/ QueensKnights-050-05-mul.xml |
| MD5SUM | 0dc4c2f273d2e82d82a6e1c594dd299c |
| 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 | 13.9722 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 55 |
| Number of constraints | 1485 |
| Number of domains | 2 |
| Minimum domain size | 50 |
| Maximum domain size | 2500 |
| Distribution of domain sizes | [{"size":50,"count":50},{"size":2500,"count":5}] |
| Minimum variable degree | 54 |
| Maximum variable degree | 54 |
| Distribution of variable degrees | [{"degree":54,"count":55}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":1485}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1485 |
| Distribution of constraint types | [{"type":"intension","count":1485}] |
| 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: