Is this predicate logic semantic tree open or closed?

Question

I have this formula: $\forall y\neg A(y)\land\exists x A(x)$ .

Is a semantic tree for this formula closed or open?

Answer 1

Obviously it is closed.

Just think about the definition of closed formula :

A formula is closed if it does not contains free occurrence.