| Name | Random/Random-RB-2-40-19f/ rand-2-40-19-443-230f-30.xml |
| MD5SUM | 50ce50ecf2588fb2b611ab94508eaebd |
| 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 | 44.0789 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 334 |
| Number of domains | 1 |
| Minimum domain size | 19 |
| Maximum domain size | 19 |
| Distribution of domain sizes | [{"size":19,"count":40}] |
| Minimum variable degree | 8 |
| Maximum variable degree | 21 |
| Distribution of variable degrees | [{"degree":8,"count":1},{"degree":10,"count":1},{"degree":12,"count":2},{"degree":13,"count":2},{"degree":14,"count":3},{"degree":15,"count":6},{"degree":16,"count":3},{"degree":17,"count":4},{"degree":18,"count":4},{"degree":19,"count":4},{"degree":20,"count":6},{"degree":21,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":334}] |
| Number of extensional constraints | 334 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":334}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.5 (complete) | 4391587 | SAT | 44.0789 | 44.0992 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407556 | SAT | 60.2216 | 60.2395 |
| cosoco 2 (complete) | 4389987 | SAT | 99.8448 | 99.8538 |
| cosoco 2.0 (complete) | 4408527 | SAT | 102.84 | 102.829 |
| cosoco 2.0 (complete) | 4397267 | SAT | 114.1 | 114.092 |
| NACRE 1.0.5-Hybrid (complete) | 4391387 | SAT | 975.988 | 976.047 |
| miniBTD 19.06.16 (complete) | 4391787 | SAT | 1733.97 | 1734.13 |
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] </list> <values> 2 7 3 6 3 7 11 0 8 3 4 8 10 14 5 5 6 9 14 6 12 11 16 14 12 13 14 4 18 5 10 12 18 8 4 11 9 1 1 17 </values> </instantiation>