| Name | PigeonsPlus/PigeonsPlus-m1-s1/ pigeonsPlus-10-05.xml |
| MD5SUM | 11198b79b59252262e805adcf565fb89 |
| 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 | 9.06146 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 65 |
| Number of domains | 2 |
| Minimum domain size | 9 |
| Maximum domain size | 10 |
| Distribution of domain sizes | [{"size":9,"count":10},{"size":10,"count":50}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":1,"count":40},{"degree":2,"count":10},{"degree":10,"count":10}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":2,"count":55},{"arity":5,"count":10}] |
| Number of extensional constraints | 65 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":65}] |
| 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: