%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU834^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n020.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:32 PM UTC 2025 % Result : Theorem 3.31s 3.50s % Output : Proof 3.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SEU834^5 : TPTP v9.2.0. Released v4.0.0. % 0.03/0.13 % Command : duper %s % 0.13/0.33 % Computer : n020.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 : Fri Oct 3 06:48:08 EDT 2025 % 0.13/0.33 % CPUTime : % 3.31/3.50 SZS status Theorem for theBenchmark.p % 3.31/3.50 SZS output start Proof for theBenchmark.p % 3.31/3.50 Clause #0 (by assumption #[]): Eq (Not (∀ (S T : a → Prop) (Xx : a), And (S Xx) (T Xx) → T Xx)) True % 3.31/3.50 Clause #1 (by clausification #[0]): Eq (∀ (S T : a → Prop) (Xx : a), And (S Xx) (T Xx) → T Xx) False % 3.31/3.50 Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop), Eq (Not (∀ (T : a → Prop) (Xx : a), And (skS.0 0 a_1 Xx) (T Xx) → T Xx)) True % 3.31/3.50 Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop), Eq (∀ (T : a → Prop) (Xx : a), And (skS.0 0 a_1 Xx) (T Xx) → T Xx) False % 3.31/3.50 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop), Eq (Not (∀ (Xx : a), And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx) → skS.0 1 a_1 a_2 Xx)) True % 3.31/3.50 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop), Eq (∀ (Xx : a), And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx) → skS.0 1 a_1 a_2 Xx) False % 3.31/3.50 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.31/3.50 Eq % 3.31/3.50 (Not % 3.31/3.50 (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) → % 3.31/3.50 skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) % 3.31/3.50 True % 3.31/3.50 Clause #7 (by clausification #[6]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.31/3.50 Eq % 3.31/3.50 (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) → % 3.31/3.50 skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) % 3.31/3.50 False % 3.31/3.50 Clause #8 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.31/3.50 Eq (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True % 3.31/3.50 Clause #9 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) False % 3.31/3.50 Clause #10 (by clausification #[8]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) True % 3.31/3.50 Clause #12 (by superposition #[9, 10]): Eq True False % 3.31/3.50 Clause #13 (by clausification #[12]): False % 3.31/3.50 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------