| Name | QRandom/ QRandom-geometric-rw/geometric-50-20-d4-75-31.xml |
| MD5SUM | f18b5c829ca7556822a75f6c246dce23 |
| 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 | 0.035268 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 377 |
| Number of domains | 1 |
| Minimum domain size | 20 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":20,"count":50}] |
| Minimum variable degree | 10 |
| Maximum variable degree | 23 |
| Distribution of variable degrees | [{"degree":10,"count":4},{"degree":11,"count":5},{"degree":12,"count":3},{"degree":13,"count":5},{"degree":14,"count":5},{"degree":15,"count":6},{"degree":16,"count":8},{"degree":17,"count":1},{"degree":18,"count":5},{"degree":19,"count":4},{"degree":21,"count":2},{"degree":22,"count":1},{"degree":23,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":377}] |
| Number of extensional constraints | 377 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":377}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.5-Hybrid (complete) | 4391373 | SAT | 0.035268 | 0.036114 |
| NACRE 1.0.5 (complete) | 4391573 | SAT | 0.035422 | 0.0354629 |
| miniBTD 19.06.16 (complete) | 4391773 | SAT | 0.044534 | 0.044754 |
| cosoco 2.0 (complete) | 4397253 | SAT | 0.107033 | 0.108555 |
| cosoco 2 (complete) | 4389973 | SAT | 0.108042 | 0.111974 |
| cosoco 2.0 (complete) | 4408513 | SAT | 0.108407 | 0.108295 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407616 | SAT | 0.308653 | 0.31002 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <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] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] </list> <values> 2 17 1 4 8 7 1 9 7 14 5 3 14 20 16 1 8 5 1 3 10 19 6 3 4 2 9 4 19 15 15 7 2 3 19 2 1 4 2 18 10 9 2 6 9 3 7 15 10 1 </values> </instantiation>