Can someone help me solve this logic question related to truth trees?

[deadcrrush]

So, the 'Correctness' rule for truth trees in logic states that, where S is a consistent set of sentences, any tree for S will remain open.

So how can I explain how the correctness result allows us to show that, if a tree for the argument 'X, Y therefore Z' closes, then X, Y I= R.