Consider the following formula in propositional logic.

The knowledge base from (1) to (10) is given.

1. (~ => ) ( => )

2. => ( )

3. => ( )

4. ( ) =>

5. ( ) =>

6. => ( )

7.

Q 8. ~F

9. ~A

10. E

(1). Converting the above to Conjunctive Normal Form.

(2). From the result of (1), prove G by using reference rules as Method 1 of the lecture note. Write the process of the proof with the corresponding number of rules and facts.

(3) From the result of (1), prove KB |= G by contradiction as to show KB /\ ~ G is unsatifiable as Method 2 of the lecture note. Write the process of the proof with the corresponding number of rules and facts. You should start with ~ G for this process.