%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEU569^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n023.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 : Thu Aug 31 16:42:45 EDT 2023

% Result   : Theorem 3.48s 3.71s
% Output   : Proof 3.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU569^2 : TPTP v8.1.2. Released v3.7.0.
% 0.03/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n023.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.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Thu Aug 24 01:50:42 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.48/3.71  SZS status Theorem for theBenchmark.p
% 3.48/3.71  SZS output start Proof for theBenchmark.p
% 3.48/3.71  Clause #0 (by assumption #[]): Eq (Eq subsetI2 (∀ (A B : Iota), (∀ (Xx : Iota), in Xx A → in Xx B) → subset A B)) True
% 3.48/3.71  Clause #1 (by assumption #[]): Eq (Not (subsetI2 → ∀ (A : Iota), subset A A)) True
% 3.48/3.71  Clause #2 (by clausification #[1]): Eq (subsetI2 → ∀ (A : Iota), subset A A) False
% 3.48/3.71  Clause #3 (by clausification #[2]): Eq subsetI2 True
% 3.48/3.71  Clause #4 (by clausification #[2]): Eq (∀ (A : Iota), subset A A) False
% 3.48/3.71  Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (Not (subset (skS.0 0 a) (skS.0 0 a))) True
% 3.48/3.71  Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (subset (skS.0 0 a) (skS.0 0 a)) False
% 3.48/3.71  Clause #7 (by clausification #[0]): Eq subsetI2 (∀ (A B : Iota), (∀ (Xx : Iota), in Xx A → in Xx B) → subset A B)
% 3.48/3.71  Clause #8 (by forward demodulation #[7, 3]): Eq True (∀ (A B : Iota), (∀ (Xx : Iota), in Xx A → in Xx B) → subset A B)
% 3.48/3.71  Clause #9 (by clausification #[8]): ∀ (a : Iota), Eq (∀ (B : Iota), (∀ (Xx : Iota), in Xx a → in Xx B) → subset a B) True
% 3.48/3.71  Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Eq ((∀ (Xx : Iota), in Xx a → in Xx a_1) → subset a a_1) True
% 3.48/3.71  Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Or (Eq (∀ (Xx : Iota), in Xx a → in Xx a_1) False) (Eq (subset a a_1) True)
% 3.48/3.71  Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota),
% 3.48/3.71    Or (Eq (subset a a_1) True) (Eq (Not (in (skS.0 1 a a_1 a_2) a → in (skS.0 1 a a_1 a_2) a_1)) True)
% 3.48/3.71  Clause #13 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Or (Eq (subset a a_1) True) (Eq (in (skS.0 1 a a_1 a_2) a → in (skS.0 1 a a_1 a_2) a_1) False)
% 3.48/3.71  Clause #14 (by clausification #[13]): ∀ (a a_1 a_2 : Iota), Or (Eq (subset a a_1) True) (Eq (in (skS.0 1 a a_1 a_2) a) True)
% 3.48/3.71  Clause #15 (by clausification #[13]): ∀ (a a_1 a_2 : Iota), Or (Eq (subset a a_1) True) (Eq (in (skS.0 1 a a_1 a_2) a_1) False)
% 3.48/3.71  Clause #16 (by superposition #[15, 14]): ∀ (a : Iota), Or (Eq (subset a a) True) (Or (Eq (subset a a) True) (Eq False True))
% 3.48/3.71  Clause #17 (by clausification #[16]): ∀ (a : Iota), Or (Eq (subset a a) True) (Eq (subset a a) True)
% 3.48/3.71  Clause #18 (by eliminate duplicate literals #[17]): ∀ (a : Iota), Eq (subset a a) True
% 3.48/3.71  Clause #19 (by superposition #[18, 6]): Eq True False
% 3.48/3.71  Clause #20 (by clausification #[19]): False
% 3.48/3.71  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------