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

% Computer : n024.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:34 EDT 2023

% Result   : Theorem 3.31s 3.51s
% Output   : Proof 3.31s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SEU535^2 : TPTP v8.1.2. Released v3.7.0.
% 0.11/0.13  % Command    : duper %s
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Wed Aug 23 19:20:09 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 3.31/3.51  SZS status Theorem for theBenchmark.p
% 3.31/3.51  SZS output start Proof for theBenchmark.p
% 3.31/3.51  Clause #0 (by assumption #[]): Eq (Eq emptysetE (∀ (Xx : Iota), in Xx emptyset → ∀ (Xphi : Prop), Xphi)) True
% 3.31/3.51  Clause #1 (by assumption #[]): Eq (Not (emptysetE → ∀ (Xphi : Iota → Prop) (Xx : Iota), in Xx emptyset → Xphi Xx)) True
% 3.31/3.51  Clause #2 (by clausification #[1]): Eq (emptysetE → ∀ (Xphi : Iota → Prop) (Xx : Iota), in Xx emptyset → Xphi Xx) False
% 3.31/3.51  Clause #3 (by clausification #[2]): Eq emptysetE True
% 3.31/3.51  Clause #4 (by clausification #[2]): Eq (∀ (Xphi : Iota → Prop) (Xx : Iota), in Xx emptyset → Xphi Xx) False
% 3.31/3.51  Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop), Eq (Not (∀ (Xx : Iota), in Xx emptyset → skS.0 0 a Xx)) True
% 3.31/3.51  Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop), Eq (∀ (Xx : Iota), in Xx emptyset → skS.0 0 a Xx) False
% 3.31/3.51  Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (Not (in (skS.0 1 a a_1) emptyset → skS.0 0 a (skS.0 1 a a_1))) True
% 3.31/3.51  Clause #8 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (in (skS.0 1 a a_1) emptyset → skS.0 0 a (skS.0 1 a a_1)) False
% 3.31/3.51  Clause #9 (by clausification #[8]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (in (skS.0 1 a a_1) emptyset) True
% 3.31/3.51  Clause #11 (by clausification #[0]): Eq emptysetE (∀ (Xx : Iota), in Xx emptyset → ∀ (Xphi : Prop), Xphi)
% 3.31/3.51  Clause #12 (by forward demodulation #[11, 3]): Eq True (∀ (Xx : Iota), in Xx emptyset → ∀ (Xphi : Prop), Xphi)
% 3.31/3.51  Clause #13 (by clausification #[12]): ∀ (a : Iota), Eq (in a emptyset → ∀ (Xphi : Prop), Xphi) True
% 3.31/3.51  Clause #14 (by clausification #[13]): ∀ (a : Iota), Or (Eq (in a emptyset) False) (Eq (∀ (Xphi : Prop), Xphi) True)
% 3.31/3.51  Clause #15 (by clausification #[14]): ∀ (a : Iota) (a_1 : Prop), Or (Eq (in a emptyset) False) (Eq a_1 True)
% 3.31/3.51  Clause #16 (by superposition #[15, 9]): ∀ (a : Prop), Or (Eq a True) (Eq False True)
% 3.31/3.51  Clause #17 (by clausification #[16]): ∀ (a : Prop), Eq a True
% 3.31/3.51  Clause #18 (by falseElim #[17]): False
% 3.31/3.51  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------