| Name | QRandom/QRandom-bdd-18-21-2/ bdd-18-21-2-133-78-24.xml |
| MD5SUM | 12e2e274c64cbf9c8a04283668281b9c |
| 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.97166 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 21 |
| Number of constraints | 133 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":21}] |
| Minimum variable degree | 101 |
| Maximum variable degree | 123 |
| Distribution of variable degrees | [{"degree":101,"count":1},{"degree":106,"count":1},{"degree":110,"count":2},{"degree":111,"count":2},{"degree":112,"count":1},{"degree":113,"count":3},{"degree":114,"count":1},{"degree":115,"count":1},{"degree":116,"count":2},{"degree":117,"count":2},{"degree":118,"count":1},{"degree":119,"count":2},{"degree":120,"count":1},{"degree":123,"count":1}] |
| Minimum constraint arity | 18 |
| Maximum constraint arity | 18 |
| Distribution of constraint arities | [{"arity":18,"count":133}] |
| Number of extensional constraints | 133 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":133}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391908 | UNSAT | 7.97166 | 7.97263 |
| NACRE 1.0.5-Hybrid (complete) | 4391508 | UNSAT | 97.3147 | 97.3344 |
| cosoco 2.0 (complete) | 4408648 | UNSAT | 120.053 | 120.066 |
| cosoco 2 (complete) | 4390108 | UNSAT | 121.572 | 121.61 |
| cosoco 2.0 (complete) | 4397388 | UNSAT | 123.522 | 123.544 |
| NACRE 1.0.5 (complete) | 4391708 | UNSAT | 508.636 | 508.666 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407607 | ? (TO) | 2400.02 | 2399.81 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: