Assuming base 10 the alphanumeric ABAC + DBAC = ECFFC
is:
$1020\times A + 1000\times D + 200\times B + 2\times C = 10000\times E + 1001\times C + 110\times F$
So
$999\times C = 10\times (102\times A + 100\times D + 20\times B - 1000\times E - 11\times F)$
Thus
$C=0$
Now since $(2\times A)\pmod{10} = (2\times B)\pmod{10} = F$
$(A,B,C,F) \in \{(1,6,0,2),\space(2,7,0,4),\space(3,8,0,6),\space(4,9,0,8)\}$
In each case the penultimate carry in the sum is $1$ so
$A+D+1=10\times E+C=10\times E\implies E=1$
So we can remove the case where $A=1$
$(A,B,C,E,F) \in \{(2,7,0,1,4),\space(3,8,0,1,6),\space(4,9,0,1,8)\}$
And we can remove $(2,7,0,1,4)$ since $B\neq D$ and $(3,8,0,1,6)$ since $D \neq F$
Leaving only
$(A,B,C,D,E,F)=(4,9,0,5,1,8)$
Of course if we, instead, interpret the formula as
$A\times B\times A\times C + D\times B\times A\times C = E\times C\times F\times F\times C$
There are many, many solutions.
(I count $15,284$ of such solution forms).
Brute force check using Python for first case (with explicit calculation):
>>> from itertools import permutations
>>> for a, b, c, d, e, f in permutations(range(10), 6):
... abac = 1000 * a + 100 * b + 10 * a + c
... dbac = 1000 * d + 100 * b + 10 * a + c
... ecffc = 10000 * e + 1000 * c + 100 * f + 10 * f + c
... if abac + dbac == ecffc:
... a, b, c, d, e, f
...
(4, 9, 0, 5, 1, 8)
>>>
Brute force count for second case:
>>> from itertools import permutations
>>> count = 0
>>> for a, b, c, d, e, f in permutations(range(10), 6):
... bac = b * a * c
... abac = a * bac
... dbac = d * bac
... ecffc = e * (c * f) ** 2
... if abac + dbac == ecffc:
... count += 1
...
>>> count
15284
>>>
Update
As stated the question is an alphametic, so the second interpretation is invalid. However another interpretation would be to be in a base other than $10$.
For $\text{base}<10$ we may not use numbers greater than $\text{base}-1$
for bases $5$ to $9$ there are three solutions:
$\text{base},(A,B,C,D,E,F)$
$6, (2, 5, 0, 3, 1, 4)$
$8, (2, 6, 0, 5, 1, 4)$
$8, (3, 7, 0, 4, 1, 6)$
For $\text{base}>=10$ I am not quite sure where we should stop (I have not proved it to myself) but it seems there are only $6$ more solutions (making $9$ total - most likely due to divergence in the possible values of the two sides as the base increases, while $E<=1$ must remain true.):
$10, (4, 9, 0, 5, 1, 8)$
$11, (8, 2, 0, 3, 1, 5)$
$11, (9, 3, 0, 2, 1, 7)$
$12, (2, 8, 0, 9, 1, 4)$
$12, (3, 9, 0, 8, 1, 6)$
$13, (9, 2, 0, 4, 1, 5)$
Mini puzzle...
$AB\times AB = ACC\rightarrow (A,B,C)=(1,2,4)$
$AB + AB = BC\rightarrow (A,B,C)\in \{(1, 2, 4), (2, 4, 8), (2, 5, 0), (3, 7, 4), (4, 9, 8)\}$