%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO289^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n007.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:51 PM UTC 2025 % Result : Theorem 5.33s 5.59s % Output : Proof 5.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYO289^5 : TPTP v9.2.0. Released v4.0.0. % 0.11/0.13 % Command : duper %s % 0.13/0.34 % Computer : n007.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Fri Oct 3 13:52:23 EDT 2025 % 0.13/0.34 % CPUTime : % 5.33/5.59 SZS status Theorem for theBenchmark.p % 5.33/5.59 SZS output start Proof for theBenchmark.p % 5.33/5.59 Clause #0 (by assumption #[]): Eq (Not (∀ (Xr : Iota → Iota → Prop) (Xy : Iota), (∀ (Xp : Iota → Prop), Xp Xy) → Exists fun Xx => Xr Xx Xy)) True % 5.33/5.59 Clause #1 (by clausification #[0]): Eq (∀ (Xr : Iota → Iota → Prop) (Xy : Iota), (∀ (Xp : Iota → Prop), Xp Xy) → Exists fun Xx => Xr Xx Xy) False % 5.33/5.59 Clause #2 (by clausification #[1]): ∀ (a : Iota → Iota → Prop), % 5.33/5.59 Eq (Not (∀ (Xy : Iota), (∀ (Xp : Iota → Prop), Xp Xy) → Exists fun Xx => skS.0 0 a Xx Xy)) True % 5.33/5.59 Clause #3 (by clausification #[2]): ∀ (a : Iota → Iota → Prop), Eq (∀ (Xy : Iota), (∀ (Xp : Iota → Prop), Xp Xy) → Exists fun Xx => skS.0 0 a Xx Xy) False % 5.33/5.59 Clause #4 (by clausification #[3]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota), % 5.33/5.59 Eq (Not ((∀ (Xp : Iota → Prop), Xp (skS.0 1 a a_1)) → Exists fun Xx => skS.0 0 a Xx (skS.0 1 a a_1))) True % 5.33/5.59 Clause #5 (by clausification #[4]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota), % 5.33/5.59 Eq ((∀ (Xp : Iota → Prop), Xp (skS.0 1 a a_1)) → Exists fun Xx => skS.0 0 a Xx (skS.0 1 a a_1)) False % 5.33/5.59 Clause #6 (by clausification #[5]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota), Eq (∀ (Xp : Iota → Prop), Xp (skS.0 1 a a_1)) True % 5.33/5.59 Clause #8 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 : Iota → Iota → Prop) (a_2 : Iota), Eq (a (skS.0 1 a_1 a_2)) True % 5.33/5.59 Clause #12 (by fluidSup #[8, 8]): ∀ (a : Prop), Eq ((fun _ => a) True) True % 5.33/5.59 Clause #19 (by betaEtaReduce #[12]): ∀ (a : Prop), Eq a True % 5.33/5.59 Clause #20 (by falseElim #[19]): False % 5.33/5.59 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------