%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SET143^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n008.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 07:59:42 PM UTC 2025 % Result : Theorem 3.47s 3.65s % Output : Proof 3.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET143^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.14 % Command : duper %s % 0.13/0.35 % Computer : n008.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 : Thu Oct 2 13:48:23 EDT 2025 % 0.13/0.35 % CPUTime : % 3.47/3.65 SZS status Theorem for theBenchmark.p % 3.47/3.65 SZS output start Proof for theBenchmark.p % 3.47/3.65 Clause #0 (by assumption #[]): Eq (Not (∀ (X Y Z : a → Prop), Eq (fun Xx => And (And (X Xx) (Y Xx)) (Z Xx)) fun Xx => And (And (X Xx) (Y Xx)) (Z Xx))) % 3.47/3.65 True % 3.47/3.65 Clause #1 (by clausification #[0]): Eq (∀ (X Y Z : a → Prop), Eq (fun Xx => And (And (X Xx) (Y Xx)) (Z Xx)) fun Xx => And (And (X Xx) (Y Xx)) (Z Xx)) False % 3.47/3.65 Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop), % 3.47/3.65 Eq % 3.47/3.65 (Not % 3.47/3.65 (∀ (Y Z : a → Prop), % 3.47/3.65 Eq (fun Xx => And (And (skS.0 0 a_1 Xx) (Y Xx)) (Z Xx)) fun Xx => And (And (skS.0 0 a_1 Xx) (Y Xx)) (Z Xx))) % 3.47/3.65 True % 3.47/3.65 Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop), % 3.47/3.65 Eq % 3.47/3.65 (∀ (Y Z : a → Prop), % 3.47/3.65 Eq (fun Xx => And (And (skS.0 0 a_1 Xx) (Y Xx)) (Z Xx)) fun Xx => And (And (skS.0 0 a_1 Xx) (Y Xx)) (Z Xx)) % 3.47/3.65 False % 3.47/3.65 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop), % 3.47/3.65 Eq % 3.47/3.65 (Not % 3.47/3.65 (∀ (Z : a → Prop), % 3.47/3.65 Eq (fun Xx => And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (Z Xx)) fun Xx => % 3.47/3.65 And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (Z Xx))) % 3.47/3.65 True % 3.47/3.65 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop), % 3.47/3.65 Eq % 3.47/3.65 (∀ (Z : a → Prop), % 3.47/3.65 Eq (fun Xx => And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (Z Xx)) fun Xx => % 3.47/3.65 And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (Z Xx)) % 3.47/3.65 False % 3.47/3.65 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 a_3 : a → Prop), % 3.47/3.65 Eq % 3.47/3.65 (Not % 3.47/3.65 (Eq (fun Xx => And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (skS.0 2 a_1 a_2 a_3 Xx)) fun Xx => % 3.47/3.65 And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (skS.0 2 a_1 a_2 a_3 Xx))) % 3.47/3.65 True % 3.47/3.65 Clause #7 (by clausification #[6]): ∀ (a_1 a_2 a_3 : a → Prop), % 3.47/3.65 Eq % 3.47/3.65 (Eq (fun Xx => And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (skS.0 2 a_1 a_2 a_3 Xx)) fun Xx => % 3.47/3.65 And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (skS.0 2 a_1 a_2 a_3 Xx)) % 3.47/3.65 False % 3.47/3.65 Clause #8 (by clausification #[7]): ∀ (a_1 a_2 a_3 : a → Prop), % 3.47/3.65 Ne (fun Xx => And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (skS.0 2 a_1 a_2 a_3 Xx)) fun Xx => % 3.47/3.65 And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) (skS.0 2 a_1 a_2 a_3 Xx) % 3.47/3.65 Clause #9 (by eliminate resolved literals #[8]): False % 3.47/3.65 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------