Question No$.5$: $[$Resolution in First Order Logic$]$

Suppose a knowledge base contains just the following first$-$order Horn clauses:

Ancestor$($Mother$($x$),$ x$)$

Ancestor $(x,y{)}^{{?}^{?}}$ Ancestor $(y,z)=>$Ancestor$(x,z)$

Can a resolution algorithm prove the sentence not Ancestor$($John$,$John$)$ from the original knowledge base? Explain how, or why not.