| Name | Subisomorphism/ Subisomorphism-g34-g36_c18.xml |
| MD5SUM | bf1db001ac5fdaef8f815bb03b0feb23 |
| 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.568914 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 120 |
| Number of constraints | 241 |
| Number of domains | 1 |
| Minimum domain size | 120 |
| Maximum domain size | 120 |
| Distribution of domain sizes | [{"size":120,"count":120}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":5,"count":120}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 120 |
| Distribution of constraint arities | [{"arity":2,"count":240},{"arity":120,"count":1}] |
| Number of extensional constraints | 240 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":240},{"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: