| Name | Random/Random-RB-3-20-20f/ rand-3-20-20-60-632f-11.xml |
| MD5SUM | 2177eeb766f29dacd684113dff68ce63 |
| 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 | 33.0671 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 20 |
| Number of constraints | 60 |
| Number of domains | 1 |
| Minimum domain size | 20 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":20,"count":20}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":7,"count":4},{"degree":8,"count":1},{"degree":9,"count":6},{"degree":10,"count":4},{"degree":11,"count":3},{"degree":14,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":60}] |
| Number of extensional constraints | 60 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":60}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391782 | SAT | 33.0671 | 33.0655 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407564 | SAT | 104.938 | 104.955 |
| NACRE 1.0.5-Hybrid (complete) | 4391382 | SAT | 398.745 | 398.772 |
| cosoco 2.0 (complete) | 4397262 | SAT | 610.67 | 610.69 |
| cosoco 2 (complete) | 4389982 | SAT | 613.434 | 613.466 |
| cosoco 2.0 (complete) | 4408522 | SAT | 615.08 | 615.035 |
| NACRE 1.0.5 (complete) | 4391582 | SAT | 1414.87 | 1414.9 |
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] </list> <values> 18 8 11 15 13 7 0 13 13 7 14 14 7 9 2 18 12 11 8 6 </values> </instantiation>