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

% Computer : n003.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:21 EDT 2023

% Result   : Theorem 3.44s 3.67s
% Output   : Proof 3.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SEU501^2 : TPTP v8.1.2. Released v3.7.0.
% 0.14/0.14  % Command    : duper %s
% 0.15/0.35  % Computer : n003.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Wed Aug 23 12:59:22 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 3.44/3.67  SZS status Theorem for theBenchmark.p
% 3.44/3.67  SZS output start Proof for theBenchmark.p
% 3.44/3.67  Clause #0 (by assumption #[]): Eq (Eq emptysetAx (∀ (Xx : Iota), Not (in Xx emptyset))) True
% 3.44/3.67  Clause #1 (by assumption #[]): Eq (Not (emptysetAx → ∀ (Xx : Iota), in Xx emptyset → ∀ (Xphi : Prop), Xphi)) True
% 3.44/3.67  Clause #2 (by clausification #[1]): Eq (emptysetAx → ∀ (Xx : Iota), in Xx emptyset → ∀ (Xphi : Prop), Xphi) False
% 3.44/3.67  Clause #3 (by clausification #[2]): Eq emptysetAx True
% 3.44/3.67  Clause #4 (by clausification #[2]): Eq (∀ (Xx : Iota), in Xx emptyset → ∀ (Xphi : Prop), Xphi) False
% 3.44/3.67  Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (Not (in (skS.0 0 a) emptyset → ∀ (Xphi : Prop), Xphi)) True
% 3.44/3.67  Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (in (skS.0 0 a) emptyset → ∀ (Xphi : Prop), Xphi) False
% 3.44/3.67  Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (in (skS.0 0 a) emptyset) True
% 3.44/3.67  Clause #13 (by clausification #[0]): Eq emptysetAx (∀ (Xx : Iota), Not (in Xx emptyset))
% 3.44/3.67  Clause #14 (by forward demodulation #[13, 3]): Eq True (∀ (Xx : Iota), Not (in Xx emptyset))
% 3.44/3.67  Clause #15 (by clausification #[14]): ∀ (a : Iota), Eq (Not (in a emptyset)) True
% 3.44/3.67  Clause #16 (by clausification #[15]): ∀ (a : Iota), Eq (in a emptyset) False
% 3.44/3.67  Clause #17 (by superposition #[16, 7]): Eq False True
% 3.44/3.67  Clause #18 (by clausification #[17]): False
% 3.44/3.67  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------