| Name | Subisomorphism/Subisomorphism-m1-LV/ Subisomorphism-g07-g20.xml |
| MD5SUM | 0e82235f3fec0d916ef8cc7292b7f061 |
| 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 | 7.74157 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 20 |
| Number of constraints | 101 |
| Number of domains | 1 |
| Minimum domain size | 64 |
| Maximum domain size | 64 |
| Distribution of domain sizes | [{"size":64,"count":20}] |
| Minimum variable degree | 11 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":11,"count":20}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 20 |
| Distribution of constraint arities | [{"arity":2,"count":100},{"arity":20,"count":1}] |
| Number of extensional constraints | 100 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":100},{"type":"allDifferent","count":1}] |
| 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: