$a,b,c,x,y,z\in \mathbb Z$ ,they are all positive. And not equal to each other.
Let $a>b>c>0,x>y>z>0$
$$ \begin{cases} a+b+c=x+y+z\\ abc=xyz \end{cases} $$
now I have try out $1+8+12=2+3+16$ ,but is there more solutions?
comment tells me :$k(a,b,c,x,y,z)$ also works. So now the question is , how many essentially different solutions can be found?
With this Mathematica program, I get these solutions.
l = Table[{i, j, k, i j k, i + j + k}, {i, 1, 20}, {j, i + 1, 20}, {k,
j + 1, 20}] // Flatten[#, 2] &;
Select[GatherBy[l, #[[{-2, -1}]] &], Length[#] > 1 &] // Column
Show part of them.
{1, 8, 12, 96, 21}, {2, 3, 16, 96, 21},
{1, 9, 10, 90, 20}, {2, 3, 15, 90, 20},
{2, 7, 12, 168, 21}, {3, 4, 14, 168, 21},
{2, 8, 9, 144, 19}, {3, 4, 12, 144, 19},
{2, 9, 15, 270, 26}, {3, 5, 18, 270, 26},
{2, 10, 12, 240, 24}, {3, 5, 16, 240, 24},
{2, 12, 15, 360, 29}, {3, 6, 20, 360, 29},
{3, 8, 10, 240, 21}, {4, 5, 12, 240, 21},
{3, 9, 16, 432, 28}, {4, 6, 18, 432, 28},
{3, 10, 12, 360, 25}, {4, 6, 15, 360, 25}
Here is a simple parametrization of a family of solutions.
Let $R,S,T,U$ be any four positive integers such that $RS=TU$.
Then a solution is given by $$\{a,b,c\}=\{R+1,S+1,TU+T+U+1\},\{x,y,z\}=\{T+1,U+1,RS+R+S+1\}.$$
$2\times6=3\times4$ so let $R=2,S=6,T=3,U=4$.
This gives the solution $\{3,7,20\},\{4,5,21\}$.
Choose the numbers $x_2,x_3,y_1,y_3,z_1,z_2$ arbitrarily.
Define $A=y_1z_1-x_2x_3,B=x_2z_2-y_1y_3,C=x_3y_3-z_1z_2$.
Then let $x_1,y_2,z_3$ be any solution of $$Ax_1+By_2+Cz_3=0.$$
The required triples of numbers are then $\{x_1y_1z_1,x_2y_2z_2,x_3y_3z_3\},\{x_1x_2x_3,y_1y_2y_3,z_1z_2z_3\}$.
Let $x_2=x_3=y_1=y_3=1,z_1=2,z_2=4$
Then $A=1,B=3,C=-7$.
The general solution of $x_1+3y_2-7z_3=0$ is $x_1=7r-3s,y_2=s,z_3=r$.
The required triples of numbers are then $\{r,4s,14r-6s\},\{8r,s,7r-3s\}$ for 'any' choice of $r$ and $s$.