| Name | QRandom/QRandom-mdd-7-25-5/ mdd-7-25-5-56-17.xml |
| MD5SUM | 9efca6d5489e39e5f473d5ee8bd54dad |
| 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 | 253.884 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 25 |
| Number of constraints | 56 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":25}] |
| Minimum variable degree | 8 |
| Maximum variable degree | 25 |
| Distribution of variable degrees | [{"degree":8,"count":1},{"degree":10,"count":1},{"degree":11,"count":3},{"degree":12,"count":2},{"degree":13,"count":1},{"degree":14,"count":2},{"degree":15,"count":3},{"degree":16,"count":2},{"degree":17,"count":2},{"degree":18,"count":2},{"degree":19,"count":1},{"degree":20,"count":2},{"degree":22,"count":1},{"degree":23,"count":1},{"degree":25,"count":1}] |
| Minimum constraint arity | 7 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":7,"count":56}] |
| Number of extensional constraints | 56 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":56}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391874 | SAT | 253.884 | 253.888 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407615 | SAT | 384.883 | 384.893 |
| NACRE 1.0.5-Hybrid (complete) | 4391474 | SAT | 1919.53 | 1919.75 |
| NACRE 1.0.5 (complete) | 4391674 | ? (TO) | 2400.04 | 2400.01 |
| cosoco 2.0 (complete) | 4408614 | ? (TO) | 2400.05 | 2400.4 |
| cosoco 2 (complete) | 4390074 | ? (TO) | 2400.06 | 2400.2 |
| cosoco 2.0 (complete) | 4397354 | ? (TO) | 2400.08 | 2400.2 |
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] x[21] x[22] x[23] x[24] </list> <values> 0 4 4 0 0 0 0 1 1 2 3 4 3 3 0 1 0 3 2 3 3 3 2 0 4 </values> </instantiation>