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