%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU591^2 : TPTP v9.2.0. Released v3.7.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 08:01:59 PM UTC 2025 % Result : Theorem 7.42s 7.65s % Output : Proof 7.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU591^2 : TPTP v9.2.0. Released v3.7.0. % 0.07/0.13 % Command : duper %s % 0.13/0.34 % Computer : n025.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 04:57:23 EDT 2025 % 0.13/0.35 % CPUTime : % 7.42/7.65 SZS status Theorem for theBenchmark.p % 7.42/7.65 SZS output start Proof for theBenchmark.p % 7.42/7.65 Clause #0 (by assumption #[]): Eq (Eq dsetconstrEL (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A fun Xy => Xphi Xy) → in Xx A)) % 7.42/7.65 True % 7.42/7.65 Clause #1 (by assumption #[]): Eq (Eq binintersect fun A B => dsetconstr A fun Xx => in Xx B) True % 7.42/7.65 Clause #2 (by assumption #[]): Eq (Not (dsetconstrEL → ∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx A)) True % 7.42/7.65 Clause #3 (by clausification #[2]): Eq (dsetconstrEL → ∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx A) False % 7.42/7.65 Clause #4 (by clausification #[3]): Eq dsetconstrEL True % 7.42/7.65 Clause #5 (by clausification #[3]): Eq (∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx A) False % 7.42/7.65 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (Not (∀ (B Xx : Iota), in Xx (binintersect (skS.0 0 a) B) → in Xx (skS.0 0 a))) True % 7.42/7.65 Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), in Xx (binintersect (skS.0 0 a) B) → in Xx (skS.0 0 a)) False % 7.42/7.65 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Eq (Not (∀ (Xx : Iota), in Xx (binintersect (skS.0 0 a) (skS.0 1 a a_1)) → in Xx (skS.0 0 a))) True % 7.42/7.65 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (∀ (Xx : Iota), in Xx (binintersect (skS.0 0 a) (skS.0 1 a a_1)) → in Xx (skS.0 0 a)) False % 7.42/7.65 Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : Iota), % 7.42/7.65 Eq (Not (in (skS.0 2 a a_1 a_2) (binintersect (skS.0 0 a) (skS.0 1 a a_1)) → in (skS.0 2 a a_1 a_2) (skS.0 0 a))) True % 7.42/7.65 Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), % 7.42/7.65 Eq (in (skS.0 2 a a_1 a_2) (binintersect (skS.0 0 a) (skS.0 1 a a_1)) → in (skS.0 2 a a_1 a_2) (skS.0 0 a)) False % 7.42/7.65 Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (binintersect (skS.0 0 a) (skS.0 1 a a_1))) True % 7.42/7.65 Clause #13 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) False % 7.42/7.65 Clause #14 (by betaEtaReduce #[0]): Eq (Eq dsetconstrEL (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → in Xx A)) True % 7.42/7.65 Clause #15 (by clausification #[14]): Eq dsetconstrEL (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → in Xx A) % 7.42/7.65 Clause #16 (by forward demodulation #[15, 4]): Eq True (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → in Xx A) % 7.42/7.65 Clause #17 (by clausification #[16]): ∀ (a : Iota), Eq (∀ (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr a Xphi) → in Xx a) True % 7.42/7.65 Clause #18 (by clausification #[17]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (∀ (Xx : Iota), in Xx (dsetconstr a a_1) → in Xx a) True % 7.42/7.65 Clause #19 (by clausification #[18]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Eq (in a (dsetconstr a_1 a_2) → in a a_1) True % 7.42/7.65 Clause #20 (by clausification #[19]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (dsetconstr a_1 a_2)) False) (Eq (in a a_1) True) % 7.42/7.65 Clause #21 (by clausification #[1]): Eq binintersect fun A B => dsetconstr A fun Xx => in Xx B % 7.42/7.65 Clause #22 (by argument congruence #[21]): ∀ (a : Iota), Eq (binintersect a) ((fun A B => dsetconstr A fun Xx => in Xx B) a) % 7.42/7.65 Clause #24 (by betaEtaReduce #[22]): ∀ (a : Iota), Eq (binintersect a) fun B => dsetconstr a fun Xx => in Xx B % 7.42/7.65 Clause #25 (by argument congruence #[24]): ∀ (a a_1 : Iota), Eq (binintersect a a_1) ((fun B => dsetconstr a fun Xx => in Xx B) a_1) % 7.42/7.65 Clause #31 (by betaEtaReduce #[25]): ∀ (a a_1 : Iota), Eq (binintersect a a_1) (dsetconstr a fun Xx => in Xx a_1) % 7.42/7.65 Clause #33 (by superposition #[31, 20]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (binintersect a_1 a_2)) False) (Eq (in a a_1) True) % 7.42/7.65 Clause #41 (by superposition #[33, 12]): ∀ (a a_1 a_2 : Iota), Or (Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) True) (Eq False True) % 7.42/7.65 Clause #908 (by clausification #[41]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) True % 7.42/7.65 Clause #909 (by superposition #[908, 13]): Eq True False % 7.42/7.65 Clause #923 (by clausification #[909]): False % 7.42/7.65 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------