| Name | QRandom/ QRandom-bdd-15-21-2/bdd-15-21-2-2713-79-08.xml |
| MD5SUM | d991fc81a7825fd4569ca865dffdd673 |
| 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 | 1.9852 |
| 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 | 1910 |
| Maximum variable degree | 1982 |
| Distribution of variable degrees | [{"degree":1910,"count":1},{"degree":1911,"count":1},{"degree":1926,"count":1},{"degree":1929,"count":1},{"degree":1931,"count":3},{"degree":1932,"count":1},{"degree":1933,"count":1},{"degree":1934,"count":2},{"degree":1935,"count":1},{"degree":1938,"count":2},{"degree":1941,"count":2},{"degree":1946,"count":1},{"degree":1948,"count":1},{"degree":1956,"count":1},{"degree":1968,"count":1},{"degree":1982,"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-mini 1.1 (2017-07-29) (complete) | 4260209 | SAT | 1.9547 | 2.12199 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252323 | SAT | 1.95715 | 1.95809 |
| cosoco-mini 1.12 (complete) | 4267390 | SAT | 1.9852 | 1.9904799 |
| miniBTD 2017-06-30 (complete) | 4252322 | SAT | 19.937 | 19.9467 |
| miniBTD 2017-08-10 (complete) | 4264949 | SAT | 20.0478 | 20.052099 |
| Naxos 1.1.0 (complete) | 4252324 | SAT | 21.023 | 21.0239 |
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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>