If Rolle's theorem must be used, then this proof should do it.
First, use the fact that $x^7+x^5+x^3+1$ is and odd polynomial. What do we we know about complex roots of a polynomial? They come in pairs, right? So how many complex roots can $x^7+x^5+x^3+1$ have? Clearly, either zero, or two or four or six. Hence, the other roots are real, so $f$ has any one of one,three, five or seven roots. But we are assuming that there is more than one root, so there must be at least three roots.
Suppose that $f(x)=f(y)=f(z)=0$ for $x< y<z$. This implies by Rolle's theorem that there is some $c \in (x,y)$ and some $d \in (y,z)$ such that $f'(c)=f'(d)=0$, and $c<d$. We can compute $f'(x)$, it is $f'(x)= 7x^6 + 6x^4+3x^2$. We can factorize this as $$f'(x) = x^2(7x^4+6x^2+3) = (x^2)\left(7\left(x^2+\frac 37\right)^2 +\frac {12}7\right) = 0$$.
As you can see in the factorization, the term $\left(7\left(x^2+\frac 37\right)^2 +\frac {12}7\right)$ can never be zero, hence it is only possible that $x^2=0$ i.e. $x=0$. But then this means that $c=d=0$, contradicting the fact that they are different.
There are easier proofs, given by factorization IVT etc. but it is always good to see different proofs of the same thing.