| Name | Random/Random-RB-2-50-23/ rand-2-50-23-587-230-39.xml |
| MD5SUM | 6ed171dcccdb92ebb130c3872609e61b |
| 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 | 2044.77 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 462 |
| Number of domains | 1 |
| Minimum domain size | 23 |
| Maximum domain size | 23 |
| Distribution of domain sizes | [{"size":23,"count":50}] |
| Minimum variable degree | 11 |
| Maximum variable degree | 27 |
| Distribution of variable degrees | [{"degree":11,"count":2},{"degree":13,"count":4},{"degree":14,"count":2},{"degree":15,"count":4},{"degree":16,"count":5},{"degree":17,"count":1},{"degree":18,"count":6},{"degree":19,"count":4},{"degree":20,"count":9},{"degree":21,"count":2},{"degree":22,"count":4},{"degree":23,"count":2},{"degree":24,"count":2},{"degree":25,"count":2},{"degree":27,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":462}] |
| Number of extensional constraints | 462 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":462}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407562 | SAT | 2044.77 | 2045.06 |
| miniBTD 19.06.16 (complete) | 4391923 | SAT | 2253.38 | 2253.51 |
| cosoco 2.0 (complete) | 4397403 | ? (TO) | 2400.01 | 2399.8 |
| NACRE 1.0.5-Hybrid (complete) | 4391523 | ? (TO) | 2400.02 | 2400.3 |
| cosoco 2 (complete) | 4390123 | ? (TO) | 2400.04 | 2400.2 |
| NACRE 1.0.5 (complete) | 4391723 | ? (TO) | 2400.05 | 2400.01 |
| cosoco 2.0 (complete) | 4408663 | ? (TO) | 2400.06 | 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> <list> x[] </list> <values> 5 6 9 22 22 12 11 19 5 19 15 22 13 15 5 1 14 19 22 16 18 2 11 0 3 5 1 10 0 13 0 3 4 1 10 9 4 14 4 22 13 14 20 1 20 14 18 1 11 6 </values> </instantiation>