Logichard
0:00.0

In first-order resolution, we resolve clauses by finding a most general unifier (mgu). Consider the following two clauses: C1=P(x,f(y))Q(x,y)C_1 = P(x, f(y)) \lor Q(x, y) C2=¬P(g(z),z)R(z)C_2 = \neg P(g(z), z) \lor R(z) where x,y,zx, y, z are variables, and f,gf, g are function symbols. Which of the following is a valid resolvent of C1C_1 and C2C_2?