In this paper we show that if $G$ is a primitive subgroup of $S_{n}$ not large base, then any irredundant base for has size at most $5 \log n$. This the first logarithmic bound on an such groups, and best possible up to small constant. As corollary, relational complexity n+1$, maximal minimal height are both n.$ Furthermore, deduce n$ can be computed in polynomial time.