%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO253^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n017.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 08:08:48 PM UTC 2025 % Result : Theorem 5.11s 5.27s % Output : Proof 5.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SYO253^5 : TPTP v9.2.0. Released v4.0.0. % 0.11/0.12 % Command : duper %s % 0.12/0.33 % Computer : n017.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Fri Oct 3 14:28:53 EDT 2025 % 0.12/0.34 % CPUTime : % 5.11/5.27 SZS status Theorem for theBenchmark.p % 5.11/5.27 SZS output start Proof for theBenchmark.p % 5.11/5.27 Clause #0 (by assumption #[]): Eq (Not (Exists fun Xf => And (Xf (And p (Not p))) (Not (Xf (Or p (Not p)))))) True % 5.11/5.27 Clause #1 (by clausification #[0]): Eq (Exists fun Xf => And (Xf (And p (Not p))) (Not (Xf (Or p (Not p))))) False % 5.11/5.27 Clause #2 (by clausification #[1]): ∀ (a : Prop → Prop), Eq (And (a (And p (Not p))) (Not (a (Or p (Not p))))) False % 5.11/5.27 Clause #3 (by clausification #[2]): ∀ (a : Prop → Prop), Or (Eq (a (And p (Not p))) False) (Eq (Not (a (Or p (Not p)))) False) % 5.11/5.27 Clause #4 (by clausification #[3]): ∀ (a : Prop → Prop), Or (Eq (a (And p (Not p))) False) (Eq (a (Or p (Not p))) True) % 5.11/5.27 Clause #5 (by bool simp #[4]): ∀ (a : Prop → Prop), Or (Eq (a False) False) (Eq (a (Or p (Not p))) True) % 5.11/5.27 Clause #6 (by bool simp #[5]): ∀ (a : Prop → Prop), Or (Eq (a False) False) (Eq (a True) True) % 5.11/5.27 Clause #8 (by neHoist #[6]): ∀ (a : Prop → Sort _abstMVar.0) (a_1 a_2 : (x : Prop) → a x), % 5.11/5.27 Or (Eq ((fun x => Ne (a_1 x) (a_2 x)) True) True) (Or (Eq True False) (Eq (a_1 False) (a_2 False))) % 5.11/5.27 Clause #31 (by betaEtaReduce #[8]): ∀ (a : Prop → Sort _abstMVar.0) (a_1 a_2 : (x : Prop) → a x), % 5.11/5.27 Or (Eq (Ne (a_1 True) (a_2 True)) True) (Or (Eq True False) (Eq (a_1 False) (a_2 False))) % 5.11/5.27 Clause #32 (by clausification #[31]): ∀ (a : Prop → Sort _abstMVar.0) (a_1 a_2 : (x : Prop) → a x), % 5.11/5.27 Or (Eq True False) (Or (Eq (a_1 False) (a_2 False)) (Ne (a_1 True) (a_2 True))) % 5.11/5.27 Clause #33 (by clausification #[32]): ∀ (a : Prop → Sort _abstMVar.0) (a_1 a_2 : (x : Prop) → a x), Or (Eq (a_1 False) (a_2 False)) (Ne (a_1 True) (a_2 True)) % 5.11/5.27 Clause #34 (by equality resolution #[33]): Eq ((fun x => x) False) ((fun x => True) False) % 5.11/5.27 Clause #37 (by betaEtaReduce #[34]): Eq False True % 5.11/5.27 Clause #38 (by clausification #[37]): False % 5.11/5.27 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------