find reslution control setratgy (breadth first method )

1. convert the sentense to predicate logic
2. convert the predicate logic to Cluses normal form (CNF)
3. find the reslution control setratgy (breadth first method )

NOTE # i will attach a solve question to know what i mean in my equstion and how to solve my question so please solved like the second image

this is the question

and solve it like this below

C1. Noor likes all kinds of food. C2. Mango and chapati are food. C3. Noor eats almond and is still alive. C4. Anything eaten by anyone and is still alive is food. Goal: Gita likes almond. In this strategy, each clause in the base set (starting set of clauses) is compared for resolution with every other clause in first round. On the second round, the new clauses produced on the first round plus all the clauses in the base set are compared for resolution. For the nth round, all previously generated clauses are added to the base set and all clauses are compared for resolution. In this strategy, the number of clauses to be compared can become extremely large at early round of large problems which make it inefficient. However, this strategy ensures find the shortest path to a solution. Example: Consider the following clauses: C1:X1[r(X1)t(X1)]. C2:X2[d(X2)7t(X2)]. C3:X3[d(X3)h(X3)]. Prove the goal: Z[h(Z)Tr(Z)]. Solution: C1:lr(X1)t(X1) C2:7d(X2)7t(X2). : C3,1:d(a) CNF