%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU536^2 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n014.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:01:51 PM UTC 2025 % Result : Theorem 3.60s 3.85s % Output : Proof 3.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SEU536^2 : TPTP v9.2.0. Released v3.7.0. % 0.03/0.13 % Command : duper %s % 0.13/0.34 % Computer : n014.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Fri Oct 3 06:26:53 EDT 2025 % 0.13/0.34 % CPUTime : % 3.60/3.85 SZS status Theorem for theBenchmark.p % 3.60/3.85 SZS output start Proof for theBenchmark.p % 3.60/3.85 Clause #0 (by assumption #[]): Eq % 3.60/3.85 (Not % 3.60/3.85 (∀ (A : Iota) (Xphi : Iota → Prop), % 3.60/3.85 Not (∀ (Xx : Iota), in Xx A → Xphi Xx) → Exists fun Xx => And (in Xx A) (Not (Xphi Xx)))) % 3.60/3.85 True % 3.60/3.85 Clause #1 (by clausification #[0]): Eq % 3.60/3.85 (∀ (A : Iota) (Xphi : Iota → Prop), % 3.60/3.85 Not (∀ (Xx : Iota), in Xx A → Xphi Xx) → Exists fun Xx => And (in Xx A) (Not (Xphi Xx))) % 3.60/3.85 False % 3.60/3.85 Clause #2 (by clausification #[1]): ∀ (a : Iota), % 3.60/3.85 Eq % 3.60/3.85 (Not % 3.60/3.85 (∀ (Xphi : Iota → Prop), % 3.60/3.85 Not (∀ (Xx : Iota), in Xx (skS.0 0 a) → Xphi Xx) → Exists fun Xx => And (in Xx (skS.0 0 a)) (Not (Xphi Xx)))) % 3.60/3.85 True % 3.60/3.85 Clause #3 (by clausification #[2]): ∀ (a : Iota), % 3.60/3.85 Eq % 3.60/3.85 (∀ (Xphi : Iota → Prop), % 3.60/3.85 Not (∀ (Xx : Iota), in Xx (skS.0 0 a) → Xphi Xx) → Exists fun Xx => And (in Xx (skS.0 0 a)) (Not (Xphi Xx))) % 3.60/3.85 False % 3.60/3.85 Clause #4 (by clausification #[3]): ∀ (a : Iota) (a_1 : Iota → Prop), % 3.60/3.85 Eq % 3.60/3.85 (Not % 3.60/3.85 (Not (∀ (Xx : Iota), in Xx (skS.0 0 a) → skS.0 1 a a_1 Xx) → % 3.60/3.85 Exists fun Xx => And (in Xx (skS.0 0 a)) (Not (skS.0 1 a a_1 Xx)))) % 3.60/3.85 True % 3.60/3.85 Clause #5 (by clausification #[4]): ∀ (a : Iota) (a_1 : Iota → Prop), % 3.60/3.85 Eq % 3.60/3.85 (Not (∀ (Xx : Iota), in Xx (skS.0 0 a) → skS.0 1 a a_1 Xx) → % 3.60/3.85 Exists fun Xx => And (in Xx (skS.0 0 a)) (Not (skS.0 1 a a_1 Xx))) % 3.60/3.85 False % 3.60/3.85 Clause #6 (by clausification #[5]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (Not (∀ (Xx : Iota), in Xx (skS.0 0 a) → skS.0 1 a a_1 Xx)) True % 3.60/3.85 Clause #7 (by clausification #[5]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (Exists fun Xx => And (in Xx (skS.0 0 a)) (Not (skS.0 1 a a_1 Xx))) False % 3.60/3.85 Clause #8 (by clausification #[6]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (∀ (Xx : Iota), in Xx (skS.0 0 a) → skS.0 1 a a_1 Xx) False % 3.60/3.85 Clause #9 (by clausification #[8]): ∀ (a : Iota) (a_1 : Iota → Prop) (a_2 : Iota), % 3.60/3.85 Eq (Not (in (skS.0 2 a a_1 a_2) (skS.0 0 a) → skS.0 1 a a_1 (skS.0 2 a a_1 a_2))) True % 3.60/3.85 Clause #10 (by clausification #[9]): ∀ (a : Iota) (a_1 : Iota → Prop) (a_2 : Iota), % 3.60/3.85 Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a) → skS.0 1 a a_1 (skS.0 2 a a_1 a_2)) False % 3.60/3.85 Clause #11 (by clausification #[10]): ∀ (a : Iota) (a_1 : Iota → Prop) (a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) True % 3.60/3.85 Clause #12 (by clausification #[10]): ∀ (a : Iota) (a_1 : Iota → Prop) (a_2 : Iota), Eq (skS.0 1 a a_1 (skS.0 2 a a_1 a_2)) False % 3.60/3.85 Clause #13 (by clausification #[7]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Eq (And (in a (skS.0 0 a_1)) (Not (skS.0 1 a_1 a_2 a))) False % 3.60/3.85 Clause #14 (by clausification #[13]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (skS.0 0 a_1)) False) (Eq (Not (skS.0 1 a_1 a_2 a)) False) % 3.60/3.85 Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (skS.0 0 a_1)) False) (Eq (skS.0 1 a_1 a_2 a) True) % 3.60/3.85 Clause #16 (by superposition #[15, 11]): ∀ (a : Iota) (a_1 a_2 : Iota → Prop) (a_3 : Iota), Or (Eq (skS.0 1 a a_1 (skS.0 2 a a_2 a_3)) True) (Eq False True) % 3.60/3.85 Clause #17 (by clausification #[16]): ∀ (a : Iota) (a_1 a_2 : Iota → Prop) (a_3 : Iota), Eq (skS.0 1 a a_1 (skS.0 2 a a_2 a_3)) True % 3.60/3.85 Clause #18 (by superposition #[17, 12]): Eq True False % 3.60/3.85 Clause #19 (by clausification #[18]): False % 3.60/3.85 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------