%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO202^5 : TPTP v8.1.2. Released v4.0.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 Sep  1 04:21:49 EDT 2023

% Result   : Theorem 3.55s 3.75s
% Output   : Proof 3.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12  % Problem    : SYO202^5 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n031.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   : Sat Aug 26 05:39:22 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.55/3.75  SZS status Theorem for theBenchmark.p
% 3.55/3.75  SZS output start Proof for theBenchmark.p
% 3.55/3.75  Clause #0 (by assumption #[]): Eq (Not (Not (Exists fun Xp => And (Xp (Eq Xp Xp)) (Not (Xp (Eq Xp Xp)))))) True
% 3.55/3.75  Clause #1 (by clausification #[0]): Eq (Not (Exists fun Xp => And (Xp (Eq Xp Xp)) (Not (Xp (Eq Xp Xp))))) False
% 3.55/3.75  Clause #2 (by clausification #[1]): Eq (Exists fun Xp => And (Xp (Eq Xp Xp)) (Not (Xp (Eq Xp Xp)))) True
% 3.55/3.75  Clause #3 (by clausification #[2]): ∀ (a : Prop → Prop),
% 3.55/3.75    Eq (And (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a))) (Not (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a))))) True
% 3.55/3.75  Clause #4 (by clausification #[3]): ∀ (a : Prop → Prop), Eq (Not (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a)))) True
% 3.55/3.75  Clause #5 (by clausification #[3]): ∀ (a : Prop → Prop), Eq (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a))) True
% 3.55/3.75  Clause #6 (by clausification #[4]): ∀ (a : Prop → Prop), Eq (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a))) False
% 3.55/3.75  Clause #7 (by bool simp #[6]): ∀ (a : Prop → Prop), Eq (skS.0 0 a True) False
% 3.55/3.75  Clause #8 (by bool simp #[5]): ∀ (a : Prop → Prop), Eq (skS.0 0 a True) True
% 3.55/3.75  Clause #9 (by superposition #[8, 7]): Eq True False
% 3.55/3.75  Clause #10 (by clausification #[9]): False
% 3.55/3.75  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------