| Name | QRandom/QRandom-bdd-18-21-2/ bdd-18-21-2-133-78-11.xml |
| MD5SUM | 25dc74dcc7a2a32497e3917bea6263ac |
| 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.2897 |
| 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 | 103 |
| Maximum variable degree | 125 |
| Distribution of variable degrees | [{"degree":103,"count":1},{"degree":106,"count":1},{"degree":109,"count":1},{"degree":110,"count":1},{"degree":112,"count":2},{"degree":113,"count":4},{"degree":114,"count":1},{"degree":115,"count":2},{"degree":116,"count":2},{"degree":117,"count":3},{"degree":118,"count":1},{"degree":120,"count":1},{"degree":125,"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) | 4391868 | SAT | 7.2897 | 7.29692 |
| cosoco 2.0 (complete) | 4408608 | SAT | 41.2892 | 41.3017 |
| cosoco 2 (complete) | 4390068 | SAT | 43.933 | 43.9443 |
| cosoco 2.0 (complete) | 4397348 | SAT | 45.7152 | 45.7215 |
| NACRE 1.0.5-Hybrid (complete) | 4391468 | SAT | 127.583 | 127.59 |
| NACRE 1.0.5 (complete) | 4391668 | SAT | 670.531 | 670.549 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407603 | ? (TO) | 2400.09 | 2400.21 |
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> 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 </values> </instantiation>