%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU917^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n022.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:38 PM UTC 2025 % Result : Theorem 5.48s 5.64s % Output : Proof 5.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SEU917^5 : TPTP v9.2.0. Released v4.0.0. % 0.09/0.11 % Command : duper %s % 0.10/0.31 % Computer : n022.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 300 % 0.10/0.31 % DateTime : Fri Oct 3 06:39:38 EDT 2025 % 0.10/0.31 % CPUTime : % 5.48/5.64 SZS status Theorem for theBenchmark.p % 5.48/5.64 SZS output start Proof for theBenchmark.p % 5.48/5.64 Clause #0 (by assumption #[]): Eq (Not (Exists fun F => ∀ (Xx Xy : Iota), Eq (F Xx) (F Xy) → Eq Xx Xy)) True % 5.48/5.64 Clause #1 (by clausification #[0]): Eq (Exists fun F => ∀ (Xx Xy : Iota), Eq (F Xx) (F Xy) → Eq Xx Xy) False % 5.48/5.64 Clause #2 (by clausification #[1]): ∀ (a : Iota → Iota), Eq (∀ (Xx Xy : Iota), Eq (a Xx) (a Xy) → Eq Xx Xy) False % 5.48/5.64 Clause #3 (by clausification #[2]): ∀ (a : Iota → Iota) (a_1 : Iota), Eq (Not (∀ (Xy : Iota), Eq (a (skS.0 0 a a_1)) (a Xy) → Eq (skS.0 0 a a_1) Xy)) True % 5.48/5.64 Clause #4 (by clausification #[3]): ∀ (a : Iota → Iota) (a_1 : Iota), Eq (∀ (Xy : Iota), Eq (a (skS.0 0 a a_1)) (a Xy) → Eq (skS.0 0 a a_1) Xy) False % 5.48/5.64 Clause #5 (by clausification #[4]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), % 5.48/5.64 Eq (Not (Eq (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2)) → Eq (skS.0 0 a a_1) (skS.0 1 a a_1 a_2))) True % 5.48/5.64 Clause #6 (by clausification #[5]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), % 5.48/5.64 Eq (Eq (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2)) → Eq (skS.0 0 a a_1) (skS.0 1 a a_1 a_2)) False % 5.48/5.64 Clause #7 (by clausification #[6]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Eq (Eq (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2))) True % 5.48/5.64 Clause #8 (by clausification #[6]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Eq (Eq (skS.0 0 a a_1) (skS.0 1 a a_1 a_2)) False % 5.48/5.64 Clause #9 (by clausification #[7]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Eq (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2)) % 5.48/5.64 Clause #18 (by clausification #[8]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Ne (skS.0 0 a a_1) (skS.0 1 a a_1 a_2) % 5.48/5.64 Clause #19 (by superposition #[18, 9]): ∀ (a : Iota), Ne (skS.0 0 (fun x => x) a) (skS.0 0 (fun x => x) a) % 5.48/5.64 Clause #20 (by eliminate resolved literals #[19]): False % 5.48/5.64 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------