%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU529^2 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n031.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:50 PM UTC 2025 % Result : Theorem 3.66s 3.86s % Output : Proof 3.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU529^2 : TPTP v9.2.0. Released v3.7.0. % 0.07/0.13 % Command : duper %s % 0.14/0.34 % Computer : n031.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Oct 3 05:08:08 EDT 2025 % 0.14/0.35 % CPUTime : % 3.66/3.86 SZS status Theorem for theBenchmark.p % 3.66/3.86 SZS output start Proof for theBenchmark.p % 3.66/3.86 Clause #0 (by assumption #[]): Eq (Eq setadjoinIL (∀ (Xx Xy : Iota), in Xx (setadjoin Xx Xy))) True % 3.66/3.86 Clause #1 (by assumption #[]): Eq (Not (setadjoinIL → ∀ (Xx Xy : Iota), Eq Xx Xy → in Xx (setadjoin Xy emptyset))) True % 3.66/3.86 Clause #2 (by clausification #[1]): Eq (setadjoinIL → ∀ (Xx Xy : Iota), Eq Xx Xy → in Xx (setadjoin Xy emptyset)) False % 3.66/3.86 Clause #3 (by clausification #[2]): Eq setadjoinIL True % 3.66/3.86 Clause #4 (by clausification #[2]): Eq (∀ (Xx Xy : Iota), Eq Xx Xy → in Xx (setadjoin Xy emptyset)) False % 3.66/3.86 Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (Not (∀ (Xy : Iota), Eq (skS.0 0 a) Xy → in (skS.0 0 a) (setadjoin Xy emptyset))) True % 3.66/3.86 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (∀ (Xy : Iota), Eq (skS.0 0 a) Xy → in (skS.0 0 a) (setadjoin Xy emptyset)) False % 3.66/3.86 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (Not (Eq (skS.0 0 a) (skS.0 1 a a_1) → in (skS.0 0 a) (setadjoin (skS.0 1 a a_1) emptyset))) True % 3.66/3.86 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Eq (Eq (skS.0 0 a) (skS.0 1 a a_1) → in (skS.0 0 a) (setadjoin (skS.0 1 a a_1) emptyset)) False % 3.66/3.86 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) True % 3.66/3.86 Clause #10 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (in (skS.0 0 a) (setadjoin (skS.0 1 a a_1) emptyset)) False % 3.66/3.86 Clause #11 (by clausification #[9]): ∀ (a a_1 : Iota), Eq (skS.0 0 a) (skS.0 1 a a_1) % 3.66/3.86 Clause #12 (by clausification #[0]): Eq setadjoinIL (∀ (Xx Xy : Iota), in Xx (setadjoin Xx Xy)) % 3.66/3.86 Clause #13 (by forward demodulation #[12, 3]): Eq True (∀ (Xx Xy : Iota), in Xx (setadjoin Xx Xy)) % 3.66/3.86 Clause #14 (by clausification #[13]): ∀ (a : Iota), Eq (∀ (Xy : Iota), in a (setadjoin a Xy)) True % 3.66/3.86 Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Eq (in a (setadjoin a a_1)) True % 3.66/3.86 Clause #16 (by forward demodulation #[10, 11]): ∀ (a : Iota), Eq (in (skS.0 0 a) (setadjoin (skS.0 0 a) emptyset)) False % 3.66/3.86 Clause #17 (by superposition #[16, 15]): Eq False True % 3.66/3.86 Clause #18 (by clausification #[17]): False % 3.66/3.86 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------