Given is the set of clauses $$\tau_1 := \left\{\left\{P, \neg S\right\}, \left\{S\right\},\left\{S,R\right\},\left\{\neg S, \neg P\right\}\right\}$$
For this set of clauses, find a logic formula $\varphi_1$ in CNF such that for all interpretations $I$ you have that $$I \models \varphi_1 \Leftrightarrow I \models \tau_1$$
I start with change the set of clauses to CNF formula.
How?
In reading they say example:
The CNF formula $$\varphi = A_1 \wedge (\neg A_2 \vee A_1) \wedge (A_3 > \vee \neg A_2 \vee \neg A_1)$$
is represented by the finite set of clauses $$\left\{\left\{A_1\right\}, \left\{\neg A_2, A_1\right\}, \left\{A_3, > \neg A_2, \neg A_1\right\}\right\}$$
So in this case the formula is: $$\varphi_1 := (P \vee \neg S) \wedge (S) \wedge (S \vee R) \wedge (\neg S \vee \neg P)$$
But I don't know it also satisfy the condition in task? I mean $$I \models \varphi_1 \Leftrightarrow I \models \tau_1$$