| Name | Subisomorphism/ Subisomorphism-g17-g42_c18.xml |
| MD5SUM | 114757bdcfe6c836d79220a034ae6c5f |
| 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 | 44.1483 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 173 |
| Number of domains | 1 |
| Minimum domain size | 128 |
| Maximum domain size | 128 |
| Distribution of domain sizes | [{"size":128,"count":64}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":3,"count":4},{"degree":5,"count":24},{"degree":6,"count":36}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":1,"count":60},{"arity":2,"count":112},{"arity":64,"count":1}] |
| Number of extensional constraints | 172 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":172},{"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: