%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : PUZ136^1 : TPTP v9.2.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n025.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:58:24 PM UTC 2025 % Result : Theorem 6.95s 7.14s % Output : Proof 6.95s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : PUZ136^1 : TPTP v9.2.0. Released v5.2.0. % 0.07/0.13 % Command : duper %s % 0.14/0.34 % Computer : n025.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Thu Oct 2 20:46:08 EDT 2025 % 0.14/0.34 % CPUTime : % 6.95/7.14 SZS status Theorem for theBenchmark.p % 6.95/7.14 SZS output start Proof for theBenchmark.p % 6.95/7.14 Clause #0 (by assumption #[]): Eq (parent kronus zeus) True % 6.95/7.14 Clause #1 (by assumption #[]): Eq (Not (parent sutekh horus)) True % 6.95/7.14 Clause #2 (by assumption #[]): Eq (Not (Exists fun P => Exists fun X => Exists fun Y => And (P X) (Not (P Y)))) True % 6.95/7.14 Clause #3 (by clausification #[1]): Eq (parent sutekh horus) False % 6.95/7.14 Clause #4 (by clausification #[2]): Eq (Exists fun P => Exists fun X => Exists fun Y => And (P X) (Not (P Y))) False % 6.95/7.14 Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop), Eq (Exists fun X => Exists fun Y => And (a X) (Not (a Y))) False % 6.95/7.14 Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (Exists fun Y => And (a a_1) (Not (a Y))) False % 6.95/7.14 Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Eq (And (a a_1) (Not (a a_2))) False % 6.95/7.14 Clause #8 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a a_1) False) (Eq (Not (a a_2)) False) % 6.95/7.14 Clause #9 (by clausification #[8]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a a_1) False) (Eq (a a_2) True) % 6.95/7.14 Clause #15 (by fluidSup #[9, 0]): ∀ (a : Iota → Prop) (a_1 : Prop → Iota) (a_2 : Iota), Or (Eq (a (a_1 True)) False) (Eq (a a_2) True) % 6.95/7.14 Clause #19 (by superposition #[9, 0]): ∀ (a : Iota), Or (Eq ((fun x => parent kronus x) a) True) (Eq False True) % 6.95/7.14 Clause #28 (by betaEtaReduce #[19]): ∀ (a : Iota), Or (Eq (parent kronus a) True) (Eq False True) % 6.95/7.14 Clause #29 (by clausification #[28]): ∀ (a : Iota), Eq (parent kronus a) True % 6.95/7.14 Clause #31 (by fluidSup #[29, 15]): ∀ (a : Iota → Iota) (a_1 : Iota), Or (Eq ((fun _ => _) True) False) (Eq ((fun x => parent x (a x)) a_1) True) % 6.95/7.14 Clause #677 (by betaEtaReduce #[31]): ∀ (a : Iota) (a_1 : Iota → Iota), Or (Eq True False) (Eq (parent a (a_1 a)) True) % 6.95/7.14 Clause #678 (by clausification #[677]): ∀ (a : Iota) (a_1 : Iota → Iota), Eq (parent a (a_1 a)) True % 6.95/7.14 Clause #679 (by superposition #[678, 3]): Eq True False % 6.95/7.14 Clause #774 (by clausification #[679]): False % 6.95/7.14 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------