| Name | QRandom/QRandom-mdd-7-25-5/ mdd-7-25-5-56-06.xml |
| MD5SUM | f9209a24bc0104c8a1f699b946be7b26 |
| 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 | 22.492 |
| 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 | 9 |
| Maximum variable degree | 24 |
| Distribution of variable degrees | [{"degree":9,"count":2},{"degree":11,"count":1},{"degree":12,"count":2},{"degree":13,"count":1},{"degree":14,"count":5},{"degree":15,"count":3},{"degree":16,"count":1},{"degree":17,"count":2},{"degree":18,"count":1},{"degree":19,"count":4},{"degree":20,"count":1},{"degree":23,"count":1},{"degree":24,"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) | 4391866 | SAT | 22.492 | 22.501 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407614 | SAT | 1021.45 | 1021.49 |
| NACRE 1.0.5 (complete) | 4391666 | ? (TO) | 2400.01 | 2400.11 |
| cosoco 2.0 (complete) | 4397346 | ? (TO) | 2400.02 | 2400.11 |
| cosoco 2 (complete) | 4390066 | ? (TO) | 2400.03 | 2400.3 |
| cosoco 2.0 (complete) | 4408606 | ? (TO) | 2400.09 | 2400.2 |
| NACRE 1.0.5-Hybrid (complete) | 4391466 | ? (TO) | 2400.09 | 2400.11 |
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> 3 4 3 0 0 0 0 2 1 1 0 0 1 3 2 3 0 3 0 4 4 4 3 1 4 </values> </instantiation>