%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU822^2 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n012.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:31 PM UTC 2025 % Result : Theorem 3.63s 3.79s % Output : Proof 3.63s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU822^2 : TPTP v9.2.0. Released v3.7.0. % 0.07/0.13 % Command : duper %s % 0.14/0.35 % Computer : n012.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Fri Oct 3 06:48:38 EDT 2025 % 0.14/0.35 % CPUTime : % 3.63/3.79 SZS status Theorem for theBenchmark.p % 3.63/3.79 SZS output start Proof for theBenchmark.p % 3.63/3.79 Clause #3 (by assumption #[]): Eq (Eq ordinalIrrefl (∀ (X : Iota), ordinal X → ∀ (A : Iota), in A X → Not (in A A))) True % 3.63/3.79 Clause #4 (by assumption #[]): Eq (Not (ordinalIrrefl → ∀ (X : Iota), ordinal X → Not (in X X))) True % 3.63/3.79 Clause #5 (by clausification #[4]): Eq (ordinalIrrefl → ∀ (X : Iota), ordinal X → Not (in X X)) False % 3.63/3.79 Clause #6 (by clausification #[5]): Eq ordinalIrrefl True % 3.63/3.79 Clause #7 (by clausification #[5]): Eq (∀ (X : Iota), ordinal X → Not (in X X)) False % 3.63/3.79 Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (Not (ordinal (skS.0 0 a) → Not (in (skS.0 0 a) (skS.0 0 a)))) True % 3.63/3.79 Clause #9 (by clausification #[8]): ∀ (a : Iota), Eq (ordinal (skS.0 0 a) → Not (in (skS.0 0 a) (skS.0 0 a))) False % 3.63/3.79 Clause #10 (by clausification #[9]): ∀ (a : Iota), Eq (ordinal (skS.0 0 a)) True % 3.63/3.79 Clause #11 (by clausification #[9]): ∀ (a : Iota), Eq (Not (in (skS.0 0 a) (skS.0 0 a))) False % 3.63/3.79 Clause #24 (by clausification #[3]): Eq ordinalIrrefl (∀ (X : Iota), ordinal X → ∀ (A : Iota), in A X → Not (in A A)) % 3.63/3.79 Clause #25 (by forward demodulation #[24, 6]): Eq True (∀ (X : Iota), ordinal X → ∀ (A : Iota), in A X → Not (in A A)) % 3.63/3.79 Clause #26 (by clausification #[25]): ∀ (a : Iota), Eq (ordinal a → ∀ (A : Iota), in A a → Not (in A A)) True % 3.63/3.79 Clause #27 (by clausification #[26]): ∀ (a : Iota), Or (Eq (ordinal a) False) (Eq (∀ (A : Iota), in A a → Not (in A A)) True) % 3.63/3.79 Clause #28 (by clausification #[27]): ∀ (a a_1 : Iota), Or (Eq (ordinal a) False) (Eq (in a_1 a → Not (in a_1 a_1)) True) % 3.63/3.79 Clause #29 (by clausification #[28]): ∀ (a a_1 : Iota), Or (Eq (ordinal a) False) (Or (Eq (in a_1 a) False) (Eq (Not (in a_1 a_1)) True)) % 3.63/3.79 Clause #30 (by clausification #[29]): ∀ (a a_1 : Iota), Or (Eq (ordinal a) False) (Or (Eq (in a_1 a) False) (Eq (in a_1 a_1) False)) % 3.63/3.79 Clause #31 (by superposition #[30, 10]): ∀ (a a_1 : Iota), Or (Eq (in a (skS.0 0 a_1)) False) (Or (Eq (in a a) False) (Eq False True)) % 3.63/3.79 Clause #32 (by clausification #[31]): ∀ (a a_1 : Iota), Or (Eq (in a (skS.0 0 a_1)) False) (Eq (in a a) False) % 3.63/3.79 Clause #33 (by clausification #[11]): ∀ (a : Iota), Eq (in (skS.0 0 a) (skS.0 0 a)) True % 3.63/3.79 Clause #34 (by superposition #[33, 32]): Or (Eq True False) (Eq True False) % 3.63/3.79 Clause #35 (by clausification #[34]): Eq True False % 3.63/3.79 Clause #36 (by clausification #[35]): False % 3.63/3.79 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------