%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU925^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n006.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 3.59s 3.76s % Output : Proof 3.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU925^5 : TPTP v9.2.0. Released v4.0.0. % 0.12/0.13 % Command : duper %s % 0.14/0.34 % Computer : n006.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Oct 3 04:14:08 EDT 2025 % 0.14/0.34 % CPUTime : % 3.59/3.76 SZS status Theorem for theBenchmark.p % 3.59/3.76 SZS output start Proof for theBenchmark.p % 3.59/3.76 Clause #0 (by assumption #[]): Eq (Not (∀ (Xx Xy : Iota), (Eq (fun Xy0 => Eq Xx Xy0) fun Xy_2 => Eq Xy Xy_2) → Eq Xx Xy)) True % 3.59/3.76 Clause #1 (by betaEtaReduce #[0]): Eq (Not (∀ (Xx Xy : Iota), Eq (Eq Xx) (Eq Xy) → Eq Xx Xy)) True % 3.59/3.76 Clause #2 (by clausification #[1]): Eq (∀ (Xx Xy : Iota), Eq (Eq Xx) (Eq Xy) → Eq Xx Xy) False % 3.59/3.76 Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (Not (∀ (Xy : Iota), Eq (Eq (skS.0 0 a)) (Eq Xy) → Eq (skS.0 0 a) Xy)) True % 3.59/3.76 Clause #4 (by clausification #[3]): ∀ (a : Iota), Eq (∀ (Xy : Iota), Eq (Eq (skS.0 0 a)) (Eq Xy) → Eq (skS.0 0 a) Xy) False % 3.59/3.76 Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (Not (Eq (Eq (skS.0 0 a)) (Eq (skS.0 1 a a_1)) → Eq (skS.0 0 a) (skS.0 1 a a_1))) True % 3.59/3.76 Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Eq (Eq (skS.0 0 a)) (Eq (skS.0 1 a a_1)) → Eq (skS.0 0 a) (skS.0 1 a a_1)) False % 3.59/3.76 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (Eq (Eq (skS.0 0 a)) (Eq (skS.0 1 a a_1))) True % 3.59/3.76 Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) False % 3.59/3.76 Clause #9 (by clausification #[7]): ∀ (a a_1 : Iota), Eq (Eq (skS.0 0 a)) (Eq (skS.0 1 a a_1)) % 3.59/3.76 Clause #10 (by argument congruence #[9]): ∀ (a a_1 a_2 : Iota), Eq (Eq (skS.0 0 a) a_1) (Eq (skS.0 1 a a_2) a_1) % 3.59/3.76 Clause #11 (by clausification #[8]): ∀ (a a_1 : Iota), Ne (skS.0 0 a) (skS.0 1 a a_1) % 3.59/3.76 Clause #14 (by eqHoist #[10]): ∀ (a a_1 a_2 : Iota), Or (Eq (Eq (skS.0 0 a) a_1) False) (Eq (skS.0 1 a a_2) a_1) % 3.59/3.76 Clause #15 (by clausification #[14]): ∀ (a a_1 a_2 : Iota), Or (Eq (skS.0 1 a a_1) a_2) (Ne (skS.0 0 a) a_2) % 3.59/3.76 Clause #16 (by destructive equality resolution #[15]): ∀ (a a_1 : Iota), Eq (skS.0 1 a a_1) (skS.0 0 a) % 3.59/3.76 Clause #17 (by forward contextual literal cutting #[16, 11]): False % 3.59/3.76 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------