| Name | QRandom/QRandom-bdd-18-21-2/ bdd-18-21-2-133-78-18.xml |
| MD5SUM | 03de5d85780f89dae2307ad754f86f2d |
| 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.66395 |
| 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 | 107 |
| Maximum variable degree | 121 |
| Distribution of variable degrees | [{"degree":107,"count":2},{"degree":111,"count":1},{"degree":112,"count":2},{"degree":113,"count":3},{"degree":114,"count":6},{"degree":115,"count":2},{"degree":116,"count":1},{"degree":117,"count":1},{"degree":118,"count":1},{"degree":120,"count":1},{"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 |
|---|---|---|---|---|
| cosoco 2.0 (complete) | 4408561 | SAT | 1.66395 | 1.66427 |
| cosoco 2 (complete) | 4390021 | SAT | 1.66631 | 1.66772 |
| cosoco 2.0 (complete) | 4397301 | SAT | 1.66867 | 1.66995 |
| miniBTD 19.06.16 (complete) | 4391821 | SAT | 1.95807 | 1.9636 |
| NACRE 1.0.5 (complete) | 4391621 | SAT | 13.5843 | 13.5847 |
| NACRE 1.0.5-Hybrid (complete) | 4391421 | SAT | 13.8471 | 13.8535 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407608 | ? (TO) | 2400.08 | 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:<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>