Suppose that the problem is formulated in discrete time and that you wish to choose the largest optimal stopping time $\
u_*$. Informally, the stopping time $\
u_*$ can be described as follows. Start at time 0 and denote the current time by $t$. If $X_t < S_t$, continue to the next timestep. Otherwise, since $S$ dominates $X$, $X_t = S_t$. If $\mathbb{E}_t[S_{t+1}]=S_t$, continue to the next timestep, otherwise stop.