Name | Subisomorphism/ Subisomorphism-g11-g30_c18.xml |
MD5SUM | bb4f87e482134ef2c2f946a146b04c70 |
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 | 192.522 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 42 |
Number of constraints | 115 |
Number of domains | 1 |
Minimum domain size | 100 |
Maximum domain size | 100 |
Distribution of domain sizes | [{"size":100,"count":42}] |
Minimum variable degree | 2 |
Maximum variable degree | 11 |
Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":1},{"degree":4,"count":4},{"degree":5,"count":6},{"degree":6,"count":10},{"degree":7,"count":6},{"degree":8,"count":11},{"degree":9,"count":2},{"degree":11,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 42 |
Distribution of constraint arities | [{"arity":2,"count":114},{"arity":42,"count":1}] |
Number of extensional constraints | 114 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":114},{"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: