Construct a resolution refutation for the set of Tseitin clauses given in Example 4.46.

Example 4.46 The sets of clauses associated with the four nodes of the graph are (clockwise from the upper-left corner): lpq, p ( t, si, lart, qrt, qri, qri). By definition, the parity of each clause associated with a node n must be opposite prs, prs, prs, prs, the parity of n. For example: 11 (prs) = 0 1