%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU934^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n026.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:02:39 PM UTC 2025 % Result : Theorem 3.53s 3.71s % Output : Proof 3.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU934^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.13 % Command : duper %s % 0.13/0.34 % Computer : n026.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 05:03:08 EDT 2025 % 0.13/0.34 % CPUTime : % 3.53/3.71 SZS status Theorem for theBenchmark.p % 3.53/3.71 SZS output start Proof for theBenchmark.p % 3.53/3.71 Clause #0 (by assumption #[]): Eq (Not (∀ (Xx Xy : Iota), (Eq (fun Y => Eq Y Xx) fun Y => Eq Y Xy) → Eq Xx Xy)) True % 3.53/3.71 Clause #1 (by clausification #[0]): Eq (∀ (Xx Xy : Iota), (Eq (fun Y => Eq Y Xx) fun Y => Eq Y Xy) → Eq Xx Xy) False % 3.53/3.71 Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (Not (∀ (Xy : Iota), (Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y Xy) → Eq (skS.0 0 a) Xy)) True % 3.53/3.71 Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (Xy : Iota), (Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y Xy) → Eq (skS.0 0 a) Xy) False % 3.53/3.71 Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), % 3.53/3.71 Eq (Not ((Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y (skS.0 1 a a_1)) → Eq (skS.0 0 a) (skS.0 1 a a_1))) True % 3.53/3.71 Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), % 3.53/3.71 Eq ((Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y (skS.0 1 a a_1)) → Eq (skS.0 0 a) (skS.0 1 a a_1)) False % 3.53/3.71 Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y (skS.0 1 a a_1)) True % 3.53/3.71 Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) False % 3.53/3.71 Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y (skS.0 1 a a_1) % 3.53/3.71 Clause #9 (by argument congruence #[8]): ∀ (a a_1 a_2 : Iota), Eq ((fun Y => Eq Y (skS.0 0 a)) a_1) ((fun Y => Eq Y (skS.0 1 a a_2)) a_1) % 3.53/3.71 Clause #11 (by clausification #[7]): ∀ (a a_1 : Iota), Ne (skS.0 0 a) (skS.0 1 a a_1) % 3.53/3.71 Clause #13 (by betaEtaReduce #[9]): ∀ (a a_1 a_2 : Iota), Eq (Eq a (skS.0 0 a_1)) (Eq a (skS.0 1 a_1 a_2)) % 3.53/3.71 Clause #16 (by eqHoist #[13]): ∀ (a a_1 a_2 : Iota), Or (Eq (Eq a (skS.0 0 a_1)) False) (Eq a (skS.0 1 a_1 a_2)) % 3.53/3.71 Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 : Iota), Or (Eq a (skS.0 1 a_1 a_2)) (Ne a (skS.0 0 a_1)) % 3.53/3.71 Clause #18 (by destructive equality resolution #[17]): ∀ (a a_1 : Iota), Eq (skS.0 0 a) (skS.0 1 a a_1) % 3.53/3.71 Clause #19 (by forward contextual literal cutting #[18, 11]): False % 3.53/3.71 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------