| Name | QRandom/ QRandom-bdd-15-21-2/bdd-15-21-2-2713-79-19.xml |
| MD5SUM | c622486bfe805fe7b4319e9c74a24dc9 |
| 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 | 21.1537 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 21 |
| Number of constraints | 2713 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":21}] |
| Minimum variable degree | 1893 |
| Maximum variable degree | 1981 |
| Distribution of variable degrees | [{"degree":1893,"count":1},{"degree":1910,"count":2},{"degree":1912,"count":1},{"degree":1916,"count":1},{"degree":1917,"count":1},{"degree":1921,"count":1},{"degree":1923,"count":1},{"degree":1927,"count":1},{"degree":1941,"count":1},{"degree":1943,"count":2},{"degree":1946,"count":2},{"degree":1951,"count":1},{"degree":1955,"count":2},{"degree":1963,"count":1},{"degree":1971,"count":2},{"degree":1981,"count":1}] |
| Minimum constraint arity | 15 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":15,"count":2713}] |
| Number of extensional constraints | 2713 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":2713}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 2 (complete) | 4390102 | SAT | 21.1537 | 21.1589 |
| cosoco 2.0 (complete) | 4408642 | SAT | 21.4087 | 21.4112 |
| cosoco 2.0 (complete) | 4397382 | SAT | 21.7554 | 21.7642 |
| miniBTD 19.06.16 (complete) | 4391902 | SAT | 22.4199 | 22.4263 |
| NACRE 1.0.5-Hybrid (complete) | 4391502 | SAT | 162.56 | 162.592 |
| NACRE 1.0.5 (complete) | 4391702 | SAT | 493.326 | 493.393 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407601 | ? (TO) | 2400.04 | 2400.12 |
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 0 0 0 </values> </instantiation>