%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU592^2 : TPTP v9.2.0. Released v3.7.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 : 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 5.06s 5.27s % Output : Proof 5.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SEU592^2 : TPTP v9.2.0. Released v3.7.0. % 0.06/0.12 % Command : duper %s % 0.11/0.32 % Computer : n017.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Fri Oct 3 06:02:53 EDT 2025 % 0.11/0.33 % CPUTime : % 5.06/5.27 SZS status Theorem for theBenchmark.p % 5.06/5.27 SZS output start Proof for theBenchmark.p % 5.06/5.27 Clause #0 (by assumption #[]): Eq (Eq subsetI2 (∀ (A B : Iota), (∀ (Xx : Iota), in Xx A → in Xx B) → subset A B)) True % 5.06/5.27 Clause #2 (by assumption #[]): Eq (Eq binintersectEL (∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx A)) True % 5.06/5.27 Clause #3 (by assumption #[]): Eq (Not (subsetI2 → binintersectEL → ∀ (A B : Iota), subset (binintersect A B) A)) True % 5.06/5.27 Clause #4 (by clausification #[0]): Eq subsetI2 (∀ (A B : Iota), (∀ (Xx : Iota), in Xx A → in Xx B) → subset A B) % 5.06/5.27 Clause #23 (by clausification #[3]): Eq (subsetI2 → binintersectEL → ∀ (A B : Iota), subset (binintersect A B) A) False % 5.06/5.27 Clause #24 (by clausification #[23]): Eq subsetI2 True % 5.06/5.27 Clause #25 (by clausification #[23]): Eq (binintersectEL → ∀ (A B : Iota), subset (binintersect A B) A) False % 5.06/5.27 Clause #26 (by backward demodulation #[24, 4]): Eq True (∀ (A B : Iota), (∀ (Xx : Iota), in Xx A → in Xx B) → subset A B) % 5.06/5.27 Clause #32 (by clausification #[26]): ∀ (a : Iota), Eq (∀ (B : Iota), (∀ (Xx : Iota), in Xx a → in Xx B) → subset a B) True % 5.06/5.27 Clause #33 (by clausification #[32]): ∀ (a a_1 : Iota), Eq ((∀ (Xx : Iota), in Xx a → in Xx a_1) → subset a a_1) True % 5.06/5.27 Clause #34 (by clausification #[33]): ∀ (a a_1 : Iota), Or (Eq (∀ (Xx : Iota), in Xx a → in Xx a_1) False) (Eq (subset a a_1) True) % 5.06/5.27 Clause #35 (by clausification #[34]): ∀ (a a_1 a_2 : Iota), % 5.06/5.27 Or (Eq (subset a a_1) True) (Eq (Not (in (skS.0 3 a a_1 a_2) a → in (skS.0 3 a a_1 a_2) a_1)) True) % 5.06/5.27 Clause #36 (by clausification #[35]): ∀ (a a_1 a_2 : Iota), Or (Eq (subset a a_1) True) (Eq (in (skS.0 3 a a_1 a_2) a → in (skS.0 3 a a_1 a_2) a_1) False) % 5.06/5.27 Clause #37 (by clausification #[36]): ∀ (a a_1 a_2 : Iota), Or (Eq (subset a a_1) True) (Eq (in (skS.0 3 a a_1 a_2) a) True) % 5.06/5.27 Clause #38 (by clausification #[36]): ∀ (a a_1 a_2 : Iota), Or (Eq (subset a a_1) True) (Eq (in (skS.0 3 a a_1 a_2) a_1) False) % 5.06/5.27 Clause #39 (by clausification #[25]): Eq binintersectEL True % 5.06/5.27 Clause #40 (by clausification #[25]): Eq (∀ (A B : Iota), subset (binintersect A B) A) False % 5.06/5.27 Clause #41 (by clausification #[40]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), subset (binintersect (skS.0 4 a) B) (skS.0 4 a))) True % 5.06/5.27 Clause #42 (by clausification #[41]): ∀ (a : Iota), Eq (∀ (B : Iota), subset (binintersect (skS.0 4 a) B) (skS.0 4 a)) False % 5.06/5.27 Clause #43 (by clausification #[42]): ∀ (a a_1 : Iota), Eq (Not (subset (binintersect (skS.0 4 a) (skS.0 5 a a_1)) (skS.0 4 a))) True % 5.06/5.27 Clause #44 (by clausification #[43]): ∀ (a a_1 : Iota), Eq (subset (binintersect (skS.0 4 a) (skS.0 5 a a_1)) (skS.0 4 a)) False % 5.06/5.27 Clause #45 (by clausification #[2]): Eq binintersectEL (∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx A) % 5.06/5.27 Clause #46 (by forward demodulation #[45, 39]): Eq True (∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx A) % 5.06/5.27 Clause #47 (by clausification #[46]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), in Xx (binintersect a B) → in Xx a) True % 5.06/5.27 Clause #48 (by clausification #[47]): ∀ (a a_1 : Iota), Eq (∀ (Xx : Iota), in Xx (binintersect a a_1) → in Xx a) True % 5.06/5.27 Clause #49 (by clausification #[48]): ∀ (a a_1 a_2 : Iota), Eq (in a (binintersect a_1 a_2) → in a a_1) True % 5.06/5.27 Clause #50 (by clausification #[49]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (binintersect a_1 a_2)) False) (Eq (in a a_1) True) % 5.06/5.27 Clause #51 (by superposition #[50, 37]): ∀ (a a_1 a_2 a_3 : Iota), % 5.06/5.27 Or (Eq (in (skS.0 3 (binintersect a a_1) a_2 a_3) a) True) % 5.06/5.27 (Or (Eq (subset (binintersect a a_1) a_2) True) (Eq False True)) % 5.06/5.27 Clause #419 (by clausification #[51]): ∀ (a a_1 a_2 a_3 : Iota), % 5.06/5.27 Or (Eq (in (skS.0 3 (binintersect a a_1) a_2 a_3) a) True) (Eq (subset (binintersect a a_1) a_2) True) % 5.06/5.27 Clause #425 (by superposition #[419, 38]): ∀ (a a_1 : Iota), % 5.06/5.27 Or (Eq (subset (binintersect a a_1) a) True) (Or (Eq (subset (binintersect a a_1) a) True) (Eq True False)) % 5.06/5.27 Clause #459 (by clausification #[425]): ∀ (a a_1 : Iota), Or (Eq (subset (binintersect a a_1) a) True) (Eq (subset (binintersect a a_1) a) True) % 5.06/5.27 Clause #460 (by eliminate duplicate literals #[459]): ∀ (a a_1 : Iota), Eq (subset (binintersect a a_1) a) True % 5.06/5.28 Clause #461 (by superposition #[460, 44]): Eq True False % 5.06/5.28 Clause #479 (by clausification #[461]): False % 5.06/5.28 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------