Two segments are given on the number line:
B = [5; 15],
C = [30; 60]. Specify
the smallest possible length of such a segment
A for which the logical expression
\((x \notin A) \rightarrow \neg((x \in B) \wedge (x \notin C) \vee (x \in C))\)
true (i.e. takes the value 1) for any value of the variable
x.