%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : LCL732^5 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n017.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 11:36:31 AM UTC 2026 % Result : Theorem 8.35s 8.63s % Output : Proof 8.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL732^5 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.04 % Command : duper %s % 0.11/0.37 % Computer : n017.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.38 % CPULimit : 300 % 0.11/0.38 % WCLimit : 300 % 0.11/0.38 % DateTime : Fri Sep 4 19:28:21 UTC 2026 % 0.11/0.38 % CPUTime : % 8.35/8.63 SZS status Theorem for theBenchmark.p % 8.35/8.63 SZS output start Proof for theBenchmark.p % 8.35/8.63 Clause #0 (by assumption #[]): Eq % 8.35/8.63 (Not % 8.35/8.63 (((b → Prop) → Exists fun Xy0 => (Exists fun Xx0 => p Xx0) → p y) → % 8.35/8.63 Exists fun Xf => (b → Prop) → (Exists fun Xx0 => p Xx0) → p y)) % 8.35/8.63 True % 8.35/8.63 Clause #1 (by betaEtaReduce #[0]): Eq (Not (((b → Prop) → Exists fun Xy0 => Exists p → p y) → Exists fun Xf => (b → Prop) → Exists p → p y)) True % 8.35/8.63 Clause #2 (by clausification #[1]): Eq (((b → Prop) → Exists fun Xy0 => Exists p → p y) → Exists fun Xf => (b → Prop) → Exists p → p y) False % 8.35/8.63 Clause #3 (by clausification #[2]): Eq ((b → Prop) → Exists fun Xy0 => Exists p → p y) True % 8.35/8.63 Clause #4 (by clausification #[2]): Eq (Exists fun Xf => (b → Prop) → Exists p → p y) False % 8.35/8.63 Clause #5 (by clausification #[3]): (b → Prop) → Eq (Exists fun Xy0 => Exists p → p y) True % 8.35/8.63 Clause #6 (by clausification #[5]): b → Eq (Exists p → p y) True % 8.35/8.63 Clause #7 (by clausification #[6]): Or (Eq (Exists p) False) (Eq (p y) True) % 8.35/8.63 Clause #8 (by clausification #[7]): ∀ (a : Iota), Or (Eq (p y) True) (Eq (p a) False) % 8.35/8.63 Clause #9 (by clausification #[4]): ((b → Prop) → b) → Eq ((b → Prop) → Exists p → p y) False % 8.35/8.63 Clause #10 (by clausification #[9]): (b → Prop) → Eq (Not (Exists p → p y)) True % 8.35/8.63 Clause #11 (by clausification #[10]): Eq (Exists p → p y) False % 8.35/8.63 Clause #12 (by clausification #[11]): Eq (Exists p) True % 8.35/8.63 Clause #13 (by clausification #[11]): Eq (p y) False % 8.35/8.63 Clause #14 (by clausification #[12]): ∀ (a : Iota), Eq (p (skS.0 2 a)) True % 8.35/8.63 Clause #15 (by superposition #[14, 8]): Or (Eq (p y) True) (Eq True False) % 8.35/8.63 Clause #16 (by clausification #[15]): Eq (p y) True % 8.35/8.63 Clause #17 (by superposition #[16, 13]): Eq True False % 8.35/8.63 Clause #18 (by clausification #[17]): False % 8.35/8.63 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------