%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEV286^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n015.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:03:01 PM UTC 2025 % Result : Theorem 3.51s 3.70s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEV286^5 : TPTP v9.2.0. Released v4.0.0. % 0.11/0.14 % Command : duper %s % 0.13/0.35 % Computer : n015.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Fri Oct 3 01:33:08 EDT 2025 % 0.13/0.35 % CPUTime : % 3.51/3.70 SZS status Theorem for theBenchmark.p % 3.51/3.70 SZS output start Proof for theBenchmark.p % 3.51/3.70 Clause #0 (by assumption #[]): Eq (Not (∀ (F : a → b) (A B : a), Eq A B → Eq (F A) (F B))) True % 3.51/3.70 Clause #1 (by clausification #[0]): Eq (∀ (F : a → b) (A B : a), Eq A B → Eq (F A) (F B)) False % 3.51/3.70 Clause #2 (by clausification #[1]): ∀ (a_1 : a → b), Eq (Not (∀ (A B : a), Eq A B → Eq (skS.0 0 a_1 A) (skS.0 0 a_1 B))) True % 3.51/3.70 Clause #3 (by clausification #[2]): ∀ (a_1 : a → b), Eq (∀ (A B : a), Eq A B → Eq (skS.0 0 a_1 A) (skS.0 0 a_1 B)) False % 3.51/3.70 Clause #4 (by clausification #[3]): ∀ (a_1 : a → b) (a_2 : a), % 3.51/3.70 Eq (Not (∀ (B : a), Eq (skS.0 1 a_1 a_2) B → Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2)) (skS.0 0 a_1 B))) True % 3.51/3.70 Clause #5 (by clausification #[4]): ∀ (a_1 : a → b) (a_2 : a), % 3.51/3.70 Eq (∀ (B : a), Eq (skS.0 1 a_1 a_2) B → Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2)) (skS.0 0 a_1 B)) False % 3.51/3.70 Clause #6 (by clausification #[5]): ∀ (a_1 : a → b) (a_2 a_3 : a), % 3.51/3.70 Eq % 3.51/3.70 (Not % 3.51/3.70 (Eq (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3) → % 3.51/3.70 Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2)) (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)))) % 3.51/3.70 True % 3.51/3.70 Clause #7 (by clausification #[6]): ∀ (a_1 : a → b) (a_2 a_3 : a), % 3.51/3.70 Eq % 3.51/3.70 (Eq (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3) → % 3.51/3.70 Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2)) (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))) % 3.51/3.70 False % 3.51/3.70 Clause #8 (by clausification #[7]): ∀ (a_1 : a → b) (a_2 a_3 : a), Eq (Eq (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) True % 3.51/3.70 Clause #9 (by clausification #[7]): ∀ (a_1 : a → b) (a_2 a_3 : a), Eq (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2)) (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))) False % 3.51/3.70 Clause #10 (by clausification #[8]): ∀ (a_1 : a → b) (a_2 a_3 : a), Eq (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3) % 3.51/3.70 Clause #11 (by clausification #[9]): ∀ (a_1 : a → b) (a_2 a_3 : a), Ne (skS.0 0 a_1 (skS.0 1 a_1 a_2)) (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) % 3.51/3.70 Clause #12 (by forward demodulation #[11, 10]): ∀ (a_1 : a → b) (a_2 : a), Ne (skS.0 0 a_1 (skS.0 1 a_1 a_2)) (skS.0 0 a_1 (skS.0 1 a_1 a_2)) % 3.51/3.70 Clause #13 (by eliminate resolved literals #[12]): False % 3.51/3.70 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------