%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO252^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n025.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 3.52s 3.75s % Output : Proof 3.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.13 % Problem : SYO252^5 : TPTP v9.2.0. Released v4.0.0. % 0.09/0.15 % Command : duper %s % 0.14/0.36 % Computer : n025.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 300 % 0.14/0.36 % DateTime : Fri Oct 3 14:11:08 EDT 2025 % 0.14/0.36 % CPUTime : % 3.52/3.75 SZS status Theorem for theBenchmark.p % 3.52/3.75 SZS output start Proof for theBenchmark.p % 3.52/3.75 Clause #0 (by assumption #[]): Eq (Not (∀ (Xp : Prop), Exists fun Xf => Not (Xf Xp))) True % 3.52/3.75 Clause #1 (by clausification #[0]): Eq (∀ (Xp : Prop), Exists fun Xf => Not (Xf Xp)) False % 3.52/3.75 Clause #2 (by clausification #[1]): ∀ (a : Prop), Eq (Not (Exists fun Xf => Not (Xf (skS.0 0 a)))) True % 3.52/3.75 Clause #3 (by clausification #[2]): ∀ (a : Prop), Eq (Exists fun Xf => Not (Xf (skS.0 0 a))) False % 3.52/3.75 Clause #4 (by clausification #[3]): ∀ (a : Prop → Prop) (a_1 : Prop), Eq (Not (a (skS.0 0 a_1))) False % 3.52/3.75 Clause #5 (by clausification #[4]): ∀ (a : Prop → Prop) (a_1 : Prop), Eq (a (skS.0 0 a_1)) True % 3.52/3.75 Clause #6 (by identity loobHoist #[5]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a True) True) (Eq (skS.0 0 a_1) False) % 3.52/3.75 Clause #7 (by identity boolHoist #[5]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a False) True) (Eq (skS.0 0 a_1) True) % 3.52/3.75 Clause #8 (by identity loobHoist #[6]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a True) True) (Or (Eq (skS.0 0 True) False) (Eq a_1 False)) % 3.52/3.75 Clause #10 (by identity loobHoist #[7]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a False) True) (Or (Eq (skS.0 0 True) True) (Eq a_1 False)) % 3.52/3.75 Clause #12 (by falseElim #[10]): ∀ (a : Prop → Prop), Or (Eq (a False) True) (Eq (skS.0 0 True) True) % 3.52/3.75 Clause #13 (by superposition #[12, 8]): ∀ (a a_1 : Prop → Prop) (a_2 : Prop), % 3.52/3.75 Or (Eq (a False) True) (Or (Eq (a_1 True) True) (Or (Eq True False) (Eq a_2 False))) % 3.52/3.75 Clause #20 (by clausification #[13]): ∀ (a a_1 : Prop → Prop) (a_2 : Prop), Or (Eq (a False) True) (Or (Eq (a_1 True) True) (Eq a_2 False)) % 3.52/3.75 Clause #22 (by falseElim #[20]): ∀ (a a_1 : Prop → Prop), Or (Eq (a False) True) (Eq (a_1 True) True) % 3.52/3.75 Clause #44 (by equality factoring #[22]): Or (Ne True True) (Eq ((fun x => x) False) True) % 3.52/3.75 Clause #46 (by betaEtaReduce #[44]): Or (Ne True True) (Eq False True) % 3.52/3.75 Clause #47 (by clausification #[46]): Or (Eq False True) (Or (Eq True False) (Eq True False)) % 3.52/3.75 Clause #49 (by clausification #[47]): Or (Eq True False) (Eq True False) % 3.52/3.75 Clause #50 (by clausification #[49]): Eq True False % 3.52/3.75 Clause #51 (by clausification #[50]): False % 3.52/3.75 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------