Your problem is to use first-order logic to represent the following example of reasoning, and use the Prover9 theorem prover to prove that the reasoning is valid.
Use the following template file to create your Prover9 encoding of the problem: greedy_rabbits.p9
Marks: There are two marks for each sentence, making a total of 6 marks.
| A1 | No old rabbits are greedy. |
| A2 | All black rabbits are greedy. |
| Goal | No old rabbits are black. |