| Name | Subisomorphism/Subisomorphism-m1-LV/ Subisomorphism-g13-g27.xml |
| MD5SUM | 08191c1a00f6acedc1c5b66da9365c90 |
| 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 | 2.65448 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 49 |
| Number of constraints | 163 |
| Number of domains | 1 |
| Minimum domain size | 86 |
| Maximum domain size | 86 |
| Distribution of domain sizes | [{"size":86,"count":49}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 21 |
| Distribution of variable degrees | [{"degree":1,"count":10},{"degree":2,"count":2},{"degree":4,"count":6},{"degree":5,"count":6},{"degree":6,"count":8},{"degree":7,"count":3},{"degree":9,"count":2},{"degree":10,"count":4},{"degree":14,"count":1},{"degree":15,"count":1},{"degree":16,"count":1},{"degree":18,"count":1},{"degree":19,"count":3},{"degree":21,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 49 |
| Distribution of constraint arities | [{"arity":1,"count":37},{"arity":2,"count":125},{"arity":49,"count":1}] |
| Number of extensional constraints | 162 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":162},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391792 | UNSAT | 2.65448 | 2.65488 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407677 | UNSAT | 72.3302 | 72.3288 |
| cosoco 2.0 (complete) | 4397272 | UNSAT | 384.612 | 384.645 |
| cosoco 2.0 (complete) | 4408532 | UNSAT | 384.926 | 384.941 |
| cosoco 2 (complete) | 4389992 | UNSAT | 388.116 | 388.078 |
| NACRE 1.0.5-Hybrid (complete) | 4391392 | UNSAT | 483.059 | 483.15 |
| NACRE 1.0.5 (complete) | 4391592 | UNSAT | 1270.82 | 1270.8 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: