Inspired by the "power-of-two-choices" model from random graphs, we investigate the possibility of limited choices of online clause choices that could shift the satisfiability threshold in random $k$-SAT.Here, we introduce an assignment symmetric, non-adaptive, topology-oblivious online rule called \emph{MIDDLE-HEAVY}, that prioritizes balanced sign profile clauses.Upon applying a biased $2$-SAT projection and a two-type branching process certificate, we derive closed-form expressions for the shifted thresholds $α_{\textbf{SYM}}(k,\ell)$ for this algorithm.We show that minimal choices $\ell=5$ for $k=4$, $\ell=4$ for $k=5$, and $\ell=3$ for $k\ge 6$ suffice to exceed the asymptotic first-moment upper bound $\sim 2^k \ln 2$ for random $k$-SAT.Moreover, to bridge the gap with biased assignment rules used in maximum of the previous works in this context, we propose a hybrid symmetric biased rule that achieves thresholds comparable to prior work while maintaining symmetry.Our results advance the understanding of Achlioptas processes in random CSPs beyond classical graph-theoretic settings.