%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN412+1 : TPTP v9.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n011.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:07:37 PM UTC 2025 % Result : Theorem 3.46s 3.61s % Output : Proof 3.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYN412+1 : TPTP v9.2.0. Released v2.0.0. % 0.03/0.12 % Command : duper %s % 0.13/0.33 % Computer : n011.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Thu Oct 2 15:35:38 EDT 2025 % 0.13/0.33 % CPUTime : % 3.46/3.61 SZS status Theorem for theBenchmark.p % 3.46/3.61 SZS output start Proof for theBenchmark.p % 3.46/3.61 Clause #0 (by assumption #[]): Eq (Not (Not (Exists fun X => ∀ (Y : Iota), Iff (f X Y) (Not (f X X))))) True % 3.46/3.61 Clause #1 (by clausification #[0]): Eq (Not (Exists fun X => ∀ (Y : Iota), Iff (f X Y) (Not (f X X)))) False % 3.46/3.61 Clause #2 (by clausification #[1]): Eq (Exists fun X => ∀ (Y : Iota), Iff (f X Y) (Not (f X X))) True % 3.46/3.61 Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (Y : Iota), Iff (f (skS.0 0 a) Y) (Not (f (skS.0 0 a) (skS.0 0 a)))) True % 3.46/3.61 Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (Iff (f (skS.0 0 a) a_1) (Not (f (skS.0 0 a) (skS.0 0 a)))) True % 3.46/3.61 Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Or (Eq (f (skS.0 0 a) a_1) True) (Eq (Not (f (skS.0 0 a) (skS.0 0 a))) False) % 3.46/3.61 Clause #6 (by clausification #[4]): ∀ (a a_1 : Iota), Or (Eq (f (skS.0 0 a) a_1) False) (Eq (Not (f (skS.0 0 a) (skS.0 0 a))) True) % 3.46/3.61 Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (f (skS.0 0 a) a_1) True) (Eq (f (skS.0 0 a) (skS.0 0 a)) True) % 3.46/3.61 Clause #8 (by equality factoring #[7]): ∀ (a : Iota), Or (Ne True True) (Eq (f (skS.0 0 a) (skS.0 0 a)) True) % 3.46/3.61 Clause #9 (by clausification #[8]): ∀ (a : Iota), Or (Eq (f (skS.0 0 a) (skS.0 0 a)) True) (Or (Eq True False) (Eq True False)) % 3.46/3.61 Clause #11 (by clausification #[9]): ∀ (a : Iota), Or (Eq (f (skS.0 0 a) (skS.0 0 a)) True) (Eq True False) % 3.46/3.61 Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (f (skS.0 0 a) (skS.0 0 a)) True % 3.46/3.61 Clause #13 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq (f (skS.0 0 a) a_1) False) (Eq (f (skS.0 0 a) (skS.0 0 a)) False) % 3.46/3.61 Clause #14 (by superposition #[13, 12]): ∀ (a : Iota), Or (Eq (f (skS.0 0 a) (skS.0 0 a)) False) (Eq False True) % 3.46/3.61 Clause #15 (by clausification #[14]): ∀ (a : Iota), Eq (f (skS.0 0 a) (skS.0 0 a)) False % 3.46/3.61 Clause #16 (by superposition #[15, 12]): Eq False True % 3.46/3.61 Clause #17 (by clausification #[16]): False % 3.46/3.61 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------