I have a bunch of vectors $\mathbf v_i$ in $\mathbb R^n$. I would like to consider the cone $C$ spanned by these vectors, together with all the other vectors that can be obtained by permuting the entries of the $\mathbf v_i$:
$$C = \sum_{\substack{1 \leq i \leq n, \pi \in S_n \\ \alpha_{i,\pi} \geq 0}} \alpha_{i,\pi} \pi(v_i).$$
Then I would like to know the generators of $C$ (again just generators up to the $S_n$ action).
I have been doing this using the fourierMotzkin package in Macaulay2: I compute all the permuted vectors, take they cone they span, and then find the generators. However, I expect that my stupid algorithm is about $n!$ times slower than it needs to be, and I am starting to consider some cases where $n!$ is not insignificant. In practice I would like to do this for $n$ up to about $20$.
What's the right way to do this? (Extra points if it is already implemented in Macaulay2 or Sage.)
(Reason for the ag.algebraic-geometry tag: the question arises in studying the effective cone of divisors on some very symmetric variety.)