%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU926^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:02:38 PM UTC 2025 % Result : Theorem 3.51s 3.68s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SEU926^5 : TPTP v9.2.0. Released v4.0.0. % 0.11/0.13 % Command : duper %s % 0.13/0.33 % Computer : n004.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Fri Oct 3 04:56:08 EDT 2025 % 0.13/0.33 % CPUTime : % 3.51/3.68 SZS status Theorem for theBenchmark.p % 3.51/3.68 SZS output start Proof for theBenchmark.p % 3.51/3.68 Clause #0 (by assumption #[]): Eq % 3.51/3.68 (Not % 3.51/3.68 (∀ (P : Iota → Prop), % 3.51/3.68 Exists fun M => ∀ (G : Iota → Iota), M G → And (M fun Z => G (G Z)) (∀ (Y : Iota), P Y → P (G Y)))) % 3.51/3.68 True % 3.51/3.68 Clause #1 (by clausification #[0]): Eq % 3.51/3.68 (∀ (P : Iota → Prop), % 3.51/3.68 Exists fun M => ∀ (G : Iota → Iota), M G → And (M fun Z => G (G Z)) (∀ (Y : Iota), P Y → P (G Y))) % 3.51/3.68 False % 3.51/3.68 Clause #2 (by clausification #[1]): ∀ (a : Iota → Prop), % 3.51/3.68 Eq % 3.51/3.68 (Not % 3.51/3.68 (Exists fun M => % 3.51/3.68 ∀ (G : Iota → Iota), M G → And (M fun Z => G (G Z)) (∀ (Y : Iota), skS.0 0 a Y → skS.0 0 a (G Y)))) % 3.51/3.68 True % 3.51/3.68 Clause #3 (by clausification #[2]): ∀ (a : Iota → Prop), % 3.51/3.68 Eq (Exists fun M => ∀ (G : Iota → Iota), M G → And (M fun Z => G (G Z)) (∀ (Y : Iota), skS.0 0 a Y → skS.0 0 a (G Y))) % 3.51/3.68 False % 3.51/3.68 Clause #4 (by clausification #[3]): ∀ (a : (Iota → Iota) → Prop) (a_1 : Iota → Prop), % 3.51/3.68 Eq (∀ (G : Iota → Iota), a G → And (a fun Z => G (G Z)) (∀ (Y : Iota), skS.0 0 a_1 Y → skS.0 0 a_1 (G Y))) False % 3.51/3.68 Clause #5 (by clausification #[4]): ∀ (a : (Iota → Iota) → Prop) (a_1 : Iota → Prop) (a_2 : Iota → Iota), % 3.51/3.68 Eq % 3.51/3.68 (Not % 3.51/3.68 (a (skS.0 1 a a_1 a_2) → % 3.51/3.68 And (a fun Z => skS.0 1 a a_1 a_2 (skS.0 1 a a_1 a_2 Z)) % 3.51/3.68 (∀ (Y : Iota), skS.0 0 a_1 Y → skS.0 0 a_1 (skS.0 1 a a_1 a_2 Y)))) % 3.51/3.68 True % 3.51/3.68 Clause #6 (by clausification #[5]): ∀ (a : (Iota → Iota) → Prop) (a_1 : Iota → Prop) (a_2 : Iota → Iota), % 3.51/3.68 Eq % 3.51/3.68 (a (skS.0 1 a a_1 a_2) → % 3.51/3.68 And (a fun Z => skS.0 1 a a_1 a_2 (skS.0 1 a a_1 a_2 Z)) % 3.51/3.68 (∀ (Y : Iota), skS.0 0 a_1 Y → skS.0 0 a_1 (skS.0 1 a a_1 a_2 Y))) % 3.51/3.68 False % 3.51/3.68 Clause #7 (by clausification #[6]): ∀ (a : (Iota → Iota) → Prop) (a_1 : Iota → Prop) (a_2 : Iota → Iota), Eq (a (skS.0 1 a a_1 a_2)) True % 3.51/3.68 Clause #12 (by fluidSup #[7, 7]): ∀ (a : Prop), Eq ((fun _ => a) True) True % 3.51/3.68 Clause #20 (by betaEtaReduce #[12]): ∀ (a : Prop), Eq a True % 3.51/3.68 Clause #21 (by falseElim #[20]): False % 3.51/3.68 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------