%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU605^2 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n020.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:01 PM UTC 2025 % Result : Theorem 4.31s 4.47s % Output : Proof 4.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU605^2 : TPTP v9.2.0. Released v3.7.0. % 0.04/0.13 % Command : duper %s % 0.13/0.34 % Computer : n020.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:29:23 EDT 2025 % 0.13/0.34 % CPUTime : % 4.31/4.47 SZS status Theorem for theBenchmark.p % 4.31/4.47 SZS output start Proof for theBenchmark.p % 4.31/4.47 Clause #0 (by assumption #[]): Eq (Eq setminusI (∀ (A B Xx : Iota), in Xx A → Not (in Xx B) → in Xx (setminus A B))) True % 4.31/4.47 Clause #1 (by assumption #[]): Eq (Not (setminusI → ∀ (A B Xx : Iota), Not (in Xx (setminus A B)) → in Xx A → in Xx B)) True % 4.31/4.47 Clause #2 (by clausification #[1]): Eq (setminusI → ∀ (A B Xx : Iota), Not (in Xx (setminus A B)) → in Xx A → in Xx B) False % 4.31/4.47 Clause #3 (by clausification #[2]): Eq setminusI True % 4.31/4.47 Clause #4 (by clausification #[2]): Eq (∀ (A B Xx : Iota), Not (in Xx (setminus A B)) → in Xx A → in Xx B) False % 4.31/4.47 Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (Not (∀ (B Xx : Iota), Not (in Xx (setminus (skS.0 0 a) B)) → in Xx (skS.0 0 a) → in Xx B)) True % 4.31/4.47 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), Not (in Xx (setminus (skS.0 0 a) B)) → in Xx (skS.0 0 a) → in Xx B) False % 4.31/4.47 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), % 4.31/4.47 Eq % 4.31/4.47 (Not % 4.31/4.47 (∀ (Xx : Iota), Not (in Xx (setminus (skS.0 0 a) (skS.0 1 a a_1))) → in Xx (skS.0 0 a) → in Xx (skS.0 1 a a_1))) % 4.31/4.47 True % 4.31/4.47 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), % 4.31/4.47 Eq (∀ (Xx : Iota), Not (in Xx (setminus (skS.0 0 a) (skS.0 1 a a_1))) → in Xx (skS.0 0 a) → in Xx (skS.0 1 a a_1)) % 4.31/4.47 False % 4.31/4.47 Clause #9 (by clausification #[8]): ∀ (a a_1 a_2 : Iota), % 4.31/4.47 Eq % 4.31/4.47 (Not % 4.31/4.47 (Not (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) (skS.0 1 a a_1))) → % 4.31/4.47 in (skS.0 2 a a_1 a_2) (skS.0 0 a) → in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1))) % 4.31/4.47 True % 4.31/4.47 Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : Iota), % 4.31/4.47 Eq % 4.31/4.47 (Not (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) (skS.0 1 a a_1))) → % 4.31/4.47 in (skS.0 2 a a_1 a_2) (skS.0 0 a) → in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) % 4.31/4.47 False % 4.31/4.47 Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), Eq (Not (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) (skS.0 1 a a_1)))) True % 4.31/4.47 Clause #12 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a) → in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) False % 4.31/4.47 Clause #13 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) (skS.0 1 a a_1))) False % 4.31/4.47 Clause #14 (by clausification #[0]): Eq setminusI (∀ (A B Xx : Iota), in Xx A → Not (in Xx B) → in Xx (setminus A B)) % 4.31/4.47 Clause #15 (by forward demodulation #[14, 3]): Eq True (∀ (A B Xx : Iota), in Xx A → Not (in Xx B) → in Xx (setminus A B)) % 4.31/4.47 Clause #16 (by clausification #[15]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), in Xx a → Not (in Xx B) → in Xx (setminus a B)) True % 4.31/4.47 Clause #17 (by clausification #[16]): ∀ (a a_1 : Iota), Eq (∀ (Xx : Iota), in Xx a → Not (in Xx a_1) → in Xx (setminus a a_1)) True % 4.31/4.47 Clause #18 (by clausification #[17]): ∀ (a a_1 a_2 : Iota), Eq (in a a_1 → Not (in a a_2) → in a (setminus a_1 a_2)) True % 4.31/4.47 Clause #19 (by clausification #[18]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a a_1) False) (Eq (Not (in a a_2) → in a (setminus a_1 a_2)) True) % 4.31/4.47 Clause #20 (by clausification #[19]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a a_1) False) (Or (Eq (Not (in a a_2)) False) (Eq (in a (setminus a_1 a_2)) True)) % 4.31/4.47 Clause #21 (by clausification #[20]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a a_1) False) (Or (Eq (in a (setminus a_1 a_2)) True) (Eq (in a a_2) True)) % 4.31/4.47 Clause #22 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) True % 4.31/4.47 Clause #23 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) False % 4.31/4.47 Clause #24 (by superposition #[22, 21]): ∀ (a a_1 a_2 a_3 : Iota), % 4.31/4.47 Or (Eq True False) % 4.31/4.47 (Or (Eq (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) a_3)) True) (Eq (in (skS.0 2 a a_1 a_2) a_3) True)) % 4.31/4.47 Clause #25 (by clausification #[24]): ∀ (a a_1 a_2 a_3 : Iota), % 4.31/4.47 Or (Eq (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) a_3)) True) (Eq (in (skS.0 2 a a_1 a_2) a_3) True) % 4.31/4.47 Clause #26 (by superposition #[25, 13]): ∀ (a a_1 a_2 : Iota), Or (Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) True) (Eq True False) % 4.31/4.47 Clause #28 (by clausification #[26]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) True % 4.31/4.47 Clause #29 (by superposition #[28, 23]): Eq True False % 4.31/4.47 Clause #31 (by clausification #[29]): False % 4.31/4.47 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------