| Name | QRandom/QRandom-bdd-18-21-2/ bdd-18-21-2-133-78-04.xml |
| MD5SUM | 98bd058b9e6ea098fba44ab4cdeb871c |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 7.75348 |
| 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 | 109 |
| Maximum variable degree | 121 |
| Distribution of variable degrees | [{"degree":109,"count":3},{"degree":110,"count":2},{"degree":111,"count":1},{"degree":112,"count":1},{"degree":113,"count":2},{"degree":114,"count":2},{"degree":115,"count":2},{"degree":116,"count":2},{"degree":117,"count":3},{"degree":118,"count":2},{"degree":121,"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) | 4391900 | SAT | 7.75348 | 7.76385 |
| cosoco 2 (complete) | 4390100 | SAT | 66.6933 | 66.7157 |
| cosoco 2.0 (complete) | 4397380 | SAT | 67.6885 | 67.7085 |
| cosoco 2.0 (complete) | 4408640 | SAT | 71.0242 | 71.0272 |
| NACRE 1.0.5-Hybrid (complete) | 4391500 | SAT | 129.862 | 129.885 |
| NACRE 1.0.5 (complete) | 4391700 | SAT | 600.365 | 600.425 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407604 | ? (TO) | 2400.06 | 2400.31 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] </list> <values> 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 </values> </instantiation>