| Name | MaxCSP/ MaxCSP-kbtree-s9-5/kbtree-9-5-3-5-80-33.xml |
| MD5SUM | 3a59b8dd6de58bfa61ad72b85e3ef803 |
| 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.00595 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 255 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":40}] |
| Minimum variable degree | 9 |
| Maximum variable degree | 39 |
| Distribution of variable degrees | [{"degree":9,"count":25},{"degree":14,"count":8},{"degree":19,"count":4},{"degree":24,"count":1},{"degree":34,"count":1},{"degree":39,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":255}] |
| Number of extensional constraints | 255 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":255}] |
| 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: