%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : PUZ083^1 : TPTP v9.2.0. Released v3.6.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n012.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Fri Oct 3 07:58:20 PM UTC 2025 % Result : Theorem 5.30s 5.56s % Output : Proof 5.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : PUZ083^1 : TPTP v9.2.0. Released v3.6.0. % 0.00/0.12 % Command : duper %s % 0.11/0.32 % Computer : n012.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Thu Oct 2 20:44:08 EDT 2025 % 0.11/0.32 % CPUTime : % 5.30/5.56 SZS status Theorem for theBenchmark.p % 5.30/5.56 SZS output start Proof for theBenchmark.p % 5.30/5.56 Clause #0 (by assumption #[]): Eq (says peter (∀ (X : Prop), says peter X → Not X)) True % 5.30/5.56 Clause #1 (by assumption #[]): Eq (Not (Not (∀ (X : Prop), says peter X → X))) True % 5.30/5.56 Clause #2 (by clausification #[1]): Eq (Not (∀ (X : Prop), says peter X → X)) False % 5.30/5.56 Clause #3 (by clausification #[2]): Eq (∀ (X : Prop), says peter X → X) True % 5.30/5.56 Clause #4 (by clausification #[3]): ∀ (a : Prop), Eq (says peter a → a) True % 5.30/5.56 Clause #5 (by clausification #[4]): ∀ (a : Prop), Or (Eq (says peter a) False) (Eq a True) % 5.30/5.56 Clause #7 (by identity boolHoist #[5]): ∀ (a : Prop), Or (Eq a True) (Or (Eq (says peter False) False) (Eq a True)) % 5.30/5.56 Clause #8 (by bool simp #[0]): Eq (says peter (And (says peter True → Not True) (says peter False → Not False))) True % 5.30/5.56 Clause #9 (by bool simp #[8]): Eq (says peter (And (says peter True → Not True) (says peter False → True))) True % 5.30/5.56 Clause #10 (by bool simp #[9]): Eq (says peter (And (says peter True → Not True) True)) True % 5.30/5.56 Clause #11 (by bool simp #[10]): Eq (says peter (says peter True → Not True)) True % 5.30/5.56 Clause #12 (by bool simp #[11]): Eq (says peter (says peter True → False)) True % 5.30/5.56 Clause #13 (by bool simp #[12]): Eq (says peter (Not (says peter True))) True % 5.30/5.56 Clause #14 (by identity loobHoist #[13]): Or (Eq (says peter True) True) (Eq (Not (says peter True)) False) % 5.30/5.56 Clause #15 (by identity boolHoist #[13]): Or (Eq (says peter False) True) (Eq (Not (says peter True)) True) % 5.30/5.56 Clause #16 (by clausification #[14]): Or (Eq (says peter True) True) (Eq (says peter True) True) % 5.30/5.56 Clause #17 (by eliminate duplicate literals #[16]): Eq (says peter True) True % 5.30/5.56 Clause #18 (by eliminate duplicate literals #[7]): ∀ (a : Prop), Or (Eq a True) (Eq (says peter False) False) % 5.30/5.56 Clause #19 (by clausification #[15]): Or (Eq (says peter False) True) (Eq (says peter True) False) % 5.30/5.56 Clause #20 (by forward demodulation #[19, 17]): Or (Eq (says peter False) True) (Eq True False) % 5.30/5.56 Clause #21 (by clausification #[20]): Eq (says peter False) True % 5.30/5.56 Clause #22 (by superposition #[21, 18]): ∀ (a : Prop), Or (Eq a True) (Eq True False) % 5.30/5.56 Clause #23 (by clausification #[22]): ∀ (a : Prop), Eq a True % 5.30/5.56 Clause #24 (by falseElim #[23]): False % 5.30/5.56 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------