In fact, the resolution of a goal clause with a definite clause to produce a new goal clause is the basis of the SLD resolution inference rule, used to implement logic programming and the programming language Prolog.
ɪ n WORD_BOUNDARY f æ k t WORD_BOUNDARY ð ə WORD_BOUNDARY ɹ ɛ z ə l uː ʃ ə n WORD_BOUNDARY ə v ə WORD_BOUNDARY ɡ oʊ l WORD_BOUNDARY k l ɔ z WORD_BOUNDARY w ɪ ð WORD_BOUNDARY ʌ WORD_BOUNDARY d ɛ f ɪ n ə t WORD_BOUNDARY k l ɔ z WORD_BOUNDARY t ə WORD_BOUNDARY p ɹ ə d uː s WORD_BOUNDARY ʌ WORD_BOUNDARY n uː WORD_BOUNDARY ɡ oʊ l WORD_BOUNDARY k l ɔ z WORD_BOUNDARY ɪ z WORD_BOUNDARY ð ə WORD_BOUNDARY b eɪ s ɪ s WORD_BOUNDARY ʌ v ð ɪ WORD_BOUNDARY ɛ s ɛ l d iː WORD_BOUNDARY ɹ ɛ z ə l uː ʃ ə n WORD_BOUNDARY ɪ n f ə ɹ ɹ ə n s WORD_BOUNDARY ɹ uː l WORD_BOUNDARY j uː z d WORD_BOUNDARY t ʊ WORD_BOUNDARY ɪ m p l ɪ m ə n t WORD_BOUNDARY l ɑ d̠ʒ ɪ k WORD_BOUNDARY p ɹ oʊ ɡ ɹ æ m ɪ ŋ WORD_BOUNDARY æ n d WORD_BOUNDARY ð ə WORD_BOUNDARY p ɹ oʊ ɡ ɹ æ m ɪ ŋ WORD_BOUNDARY l æ ŋ ɡ w ɪ d̠ʒ WORD_BOUNDARY p ɹ oʊ l ɑ ɡ WORD_BOUNDARY