%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO258^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n004.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:08:49 PM UTC 2025 % Result : Theorem 3.51s 3.71s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SYO258^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.14 % Command : duper %s % 0.12/0.36 % Computer : n004.cluster.edu % 0.12/0.36 % Model : x86_64 x86_64 % 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.36 % Memory : 8042.1875MB % 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.36 % CPULimit : 300 % 0.12/0.36 % WCLimit : 300 % 0.12/0.36 % DateTime : Fri Oct 3 13:46:53 EDT 2025 % 0.12/0.36 % CPUTime : % 3.51/3.71 SZS status Theorem for theBenchmark.p % 3.51/3.71 SZS output start Proof for theBenchmark.p % 3.51/3.71 Clause #0 (by assumption #[]): Eq % 3.51/3.71 (Not % 3.51/3.71 (And (cP a b) (∀ (E : Iota → Prop), cQ b E) → % 3.51/3.71 Exists fun A => ∀ (Xg : Iota), A Xg → And (Exists fun Xx => And (cP Xg Xx) (cQ Xx A)) (A a))) % 3.51/3.71 True % 3.51/3.71 Clause #1 (by clausification #[0]): Eq % 3.51/3.71 (And (cP a b) (∀ (E : Iota → Prop), cQ b E) → % 3.51/3.71 Exists fun A => ∀ (Xg : Iota), A Xg → And (Exists fun Xx => And (cP Xg Xx) (cQ Xx A)) (A a)) % 3.51/3.71 False % 3.51/3.71 Clause #3 (by clausification #[1]): Eq (Exists fun A => ∀ (Xg : Iota), A Xg → And (Exists fun Xx => And (cP Xg Xx) (cQ Xx A)) (A a)) False % 3.51/3.71 Clause #7 (by clausification #[3]): ∀ (a_1 : Iota → Prop), Eq (∀ (Xg : Iota), a_1 Xg → And (Exists fun Xx => And (cP Xg Xx) (cQ Xx a_1)) (a_1 a)) False % 3.51/3.71 Clause #8 (by clausification #[7]): ∀ (a_1 : Iota → Prop) (a_2 : Iota), % 3.51/3.71 Eq (Not (a_1 (skS.0 0 a_1 a_2) → And (Exists fun Xx => And (cP (skS.0 0 a_1 a_2) Xx) (cQ Xx a_1)) (a_1 a))) True % 3.51/3.71 Clause #9 (by clausification #[8]): ∀ (a_1 : Iota → Prop) (a_2 : Iota), % 3.51/3.71 Eq (a_1 (skS.0 0 a_1 a_2) → And (Exists fun Xx => And (cP (skS.0 0 a_1 a_2) Xx) (cQ Xx a_1)) (a_1 a)) False % 3.51/3.71 Clause #10 (by clausification #[9]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (a (skS.0 0 a a_1)) True % 3.51/3.71 Clause #15 (by fluidSup #[10, 10]): ∀ (a : Prop), Eq ((fun _ => a) True) True % 3.51/3.71 Clause #24 (by betaEtaReduce #[15]): ∀ (a : Prop), Eq a True % 3.51/3.71 Clause #25 (by falseElim #[24]): False % 3.51/3.71 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------