%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU122+1 : TPTP v9.2.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n009.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:00:54 PM UTC 2025 % Result : Theorem 3.58s 3.75s % Output : Proof 3.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU122+1 : TPTP v9.2.0. Released v3.3.0. % 0.12/0.13 % Command : duper %s % 0.13/0.34 % Computer : n009.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 05:47:23 EDT 2025 % 0.13/0.34 % CPUTime : % 3.58/3.75 SZS status Theorem for theBenchmark.p % 3.58/3.75 SZS output start Proof for theBenchmark.p % 3.58/3.75 Clause #1 (by assumption #[]): Eq (∀ (A B : Iota), Iff (subset A B) (∀ (C : Iota), in C A → in C B)) True % 3.58/3.75 Clause #3 (by assumption #[]): Eq (empty empty_set) True % 3.58/3.75 Clause #7 (by assumption #[]): Eq (Not (∀ (A : Iota), subset empty_set A)) True % 3.58/3.75 Clause #9 (by assumption #[]): Eq (∀ (A B : Iota), Not (And (in A B) (empty B))) True % 3.58/3.75 Clause #11 (by clausification #[7]): Eq (∀ (A : Iota), subset empty_set A) False % 3.58/3.75 Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (Not (subset empty_set (skS.0 0 a))) True % 3.58/3.75 Clause #13 (by clausification #[12]): ∀ (a : Iota), Eq (subset empty_set (skS.0 0 a)) False % 3.58/3.75 Clause #31 (by clausification #[9]): ∀ (a : Iota), Eq (∀ (B : Iota), Not (And (in a B) (empty B))) True % 3.58/3.75 Clause #32 (by clausification #[31]): ∀ (a a_1 : Iota), Eq (Not (And (in a a_1) (empty a_1))) True % 3.58/3.75 Clause #33 (by clausification #[32]): ∀ (a a_1 : Iota), Eq (And (in a a_1) (empty a_1)) False % 3.58/3.75 Clause #34 (by clausification #[33]): ∀ (a a_1 : Iota), Or (Eq (in a a_1) False) (Eq (empty a_1) False) % 3.58/3.75 Clause #35 (by clausification #[1]): ∀ (a : Iota), Eq (∀ (B : Iota), Iff (subset a B) (∀ (C : Iota), in C a → in C B)) True % 3.58/3.75 Clause #36 (by clausification #[35]): ∀ (a a_1 : Iota), Eq (Iff (subset a a_1) (∀ (C : Iota), in C a → in C a_1)) True % 3.58/3.75 Clause #37 (by clausification #[36]): ∀ (a a_1 : Iota), Or (Eq (subset a a_1) True) (Eq (∀ (C : Iota), in C a → in C a_1) False) % 3.58/3.75 Clause #39 (by clausification #[37]): ∀ (a a_1 a_2 : Iota), % 3.58/3.75 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) % 3.58/3.75 Clause #40 (by clausification #[39]): ∀ (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) % 3.58/3.75 Clause #41 (by clausification #[40]): ∀ (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) % 3.58/3.75 Clause #44 (by superposition #[41, 34]): ∀ (a a_1 : Iota), Or (Eq (subset a a_1) True) (Or (Eq True False) (Eq (empty a) False)) % 3.58/3.75 Clause #45 (by clausification #[44]): ∀ (a a_1 : Iota), Or (Eq (subset a a_1) True) (Eq (empty a) False) % 3.58/3.75 Clause #46 (by superposition #[45, 3]): ∀ (a : Iota), Or (Eq (subset empty_set a) True) (Eq False True) % 3.58/3.75 Clause #47 (by clausification #[46]): ∀ (a : Iota), Eq (subset empty_set a) True % 3.58/3.75 Clause #48 (by superposition #[47, 13]): Eq True False % 3.58/3.75 Clause #49 (by clausification #[48]): False % 3.58/3.75 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------