| Name | QueensKnights/QueensKnights-m1-s1/ QueensKnights-080-05-add.xml |
| MD5SUM | 18e8c61317b2c078d14d7e9ead8d31e0 |
| 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 | 25.0904 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 85 |
| Number of constraints | 3170 |
| Number of domains | 2 |
| Minimum domain size | 80 |
| Maximum domain size | 6400 |
| Distribution of domain sizes | [{"size":80,"count":80},{"size":6400,"count":5}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 79 |
| Distribution of variable degrees | [{"degree":4,"count":5},{"degree":79,"count":80}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":3170}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 3170 |
| Distribution of constraint types | [{"type":"intension","count":3170}] |
| 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: