In 1984, Andrews introduced the family of partition functions $c\phi_k(n)$, the number of generalized Frobenius partitions of $n$ with $k$ colors. In 2016, Gu, Wang, and Xia proved some congruences about $c\phi_6(n)$ and gave a conjecture on congruences modulo powers of 3 for $c\phi_6(n)$. We solve the revised conjecture proposed by Gu, Wang, and Xia using a method similar to that of Banerjee and Smoot.