| Name | Random/Random-D-t090/ rand-2-40-180-84-090-90.xml |
| MD5SUM | b787e2fb655876ad1ad352aa15cc79d3 |
| 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.914535 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 84 |
| Number of domains | 1 |
| Minimum domain size | 180 |
| Maximum domain size | 180 |
| Distribution of domain sizes | [{"size":180,"count":40}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":8},{"degree":3,"count":6},{"degree":4,"count":5},{"degree":5,"count":8},{"degree":6,"count":6},{"degree":7,"count":4},{"degree":8,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":84}] |
| Number of extensional constraints | 84 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":84}] |
| 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: