Prolog uses a paradigm called negation as failure, which means that formula_1 is assumed if formula_2 cannot be derived. This is different from true logical negation. While negation is failure has its benefits, it often confuses people starting to learn Prolog, as they expect true logical negation.
p ɹ oʊ l ɑ ɡ WORD_BOUNDARY j uː s ɪ z WORD_BOUNDARY ʌ WORD_BOUNDARY p æ ɹ ə d aɪ m WORD_BOUNDARY k ɔ l d WORD_BOUNDARY n ɪ ɡ eɪ ʃ ə n WORD_BOUNDARY æ z WORD_BOUNDARY f eɪ l ɪ ɹ WORD_BOUNDARY w ɪ t̠ʃ WORD_BOUNDARY m iː n z WORD_BOUNDARY ð æ t WORD_BOUNDARY f ɔ ɹ m j ʊ l ə WORD_BOUNDARY w ʌ n WORD_BOUNDARY ɪ z WORD_BOUNDARY ʌ s uː m d WORD_BOUNDARY ɪ f WORD_BOUNDARY f ɔ ɹ m j ʊ l ə WORD_BOUNDARY t uː WORD_BOUNDARY k æ n ɑ t WORD_BOUNDARY b iː WORD_BOUNDARY d ɪ ɹ aɪ v d WORD_BOUNDARY ð ɪ s WORD_BOUNDARY ɪ z WORD_BOUNDARY d ɪ f ɹ ə n t WORD_BOUNDARY f ɹ ʌ m WORD_BOUNDARY t ɹ uː WORD_BOUNDARY l ɑ d̠ʒ ɪ k ə l WORD_BOUNDARY n ɪ ɡ eɪ ʃ ə n WORD_BOUNDARY w aɪ l WORD_BOUNDARY n ɪ ɡ eɪ ʃ ə n WORD_BOUNDARY ɪ z WORD_BOUNDARY f eɪ l ɪ ɹ WORD_BOUNDARY h ʌ z WORD_BOUNDARY ɪ t s WORD_BOUNDARY b ɛ n ɪ f ɪ t s WORD_BOUNDARY ɪ t WORD_BOUNDARY ɔ f ə n WORD_BOUNDARY k ə n f j uː z ɪ z WORD_BOUNDARY p iː p ə l WORD_BOUNDARY s t ɑ ɹ t ɪ ŋ WORD_BOUNDARY t ə WORD_BOUNDARY l ɜː n WORD_BOUNDARY p ɹ oʊ l ɑ ɡ WORD_BOUNDARY æ z WORD_BOUNDARY ð eɪ WORD_BOUNDARY ɛ k s p ɛ k t WORD_BOUNDARY t ɹ uː WORD_BOUNDARY l ɑ d̠ʒ ɪ k ə l WORD_BOUNDARY n ɪ ɡ eɪ ʃ ə n WORD_BOUNDARY