Skip to content
TheChatArchiveThe Chat Archive
Geminigemini-2.5-flash· GoogleHugging Face LMArena Human Preference 140K

Create a proof from the following TFL sentence(s) A → C , B → D ⊢ (A ∧ B) → (C ∧ D)

From a Chatbot Arena battleThe same person sent this prompt to two anonymous models at once. Compare it with Claudeclaude-3-7-sonnet-20250219-thinking-32k’s answer.
  1. User

    Create a proof from the following TFL sentence(s) A → C , B → D ⊢ (A ∧ B) → (C ∧ D)

  2. Gemini Assistant

    Here's a natural deduction proof for the TFL sentence:

    Goal: A→C,B→D⊢(A∧B)→(C∧D)A \rightarrow C , B \rightarrow D \vdash (A \land B) \rightarrow (C \land D)


    1. A→CA \rightarrow C (Premise)
    2. B→DB \rightarrow D (Premise)
    3. ∣ A∧B| \ A \land B (Assumption for Conditional Proof)
    4. ∣ A| \ A (3,∧3, \land E)
    5. ∣ B| \ B (3,∧3, \land E)
    6. ∣ C| \ C (1,4,→1, 4, \rightarrow E)
    7. ∣ D| \ D (2,5,→2, 5, \rightarrow E)
    8. ∣ C∧D| \ C \land D (6,7,∧6, 7, \land I)
    9. (A∧B)→(C∧D)(A \land B) \rightarrow (C \land D) (3−8,→3-8, \rightarrow I)

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.