%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO282^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n022.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:22:03 EDT 2023

% Result   : Theorem 3.46s 3.70s
% Output   : Proof 3.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYO282^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.36  % Computer : n022.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.21/0.36  % CPULimit   : 300
% 0.21/0.36  % WCLimit    : 300
% 0.21/0.36  % DateTime   : Sat Aug 26 05:54:10 EDT 2023
% 0.21/0.36  % CPUTime    : 
% 3.46/3.70  SZS status Theorem for theBenchmark.p
% 3.46/3.70  SZS output start Proof for theBenchmark.p
% 3.46/3.70  Clause #0 (by assumption #[]): Eq (Not (∀ (Xx : b → Prop), Exists fun Xy => (Exists fun Xx0 => Xx Xx0) → Xx Xy)) True
% 3.46/3.70  Clause #1 (by betaEtaReduce #[0]): Eq (Not (∀ (Xx : b → Prop), Exists fun Xy => Exists Xx → Xx Xy)) True
% 3.46/3.70  Clause #2 (by clausification #[1]): Eq (∀ (Xx : b → Prop), Exists fun Xy => Exists Xx → Xx Xy) False
% 3.46/3.70  Clause #3 (by clausification #[2]): ∀ (a : b → Prop), Eq (Not (Exists fun Xy => Exists (skS.0 0 a) → skS.0 0 a Xy)) True
% 3.46/3.70  Clause #4 (by clausification #[3]): ∀ (a : b → Prop), Eq (Exists fun Xy => Exists (skS.0 0 a) → skS.0 0 a Xy) False
% 3.46/3.70  Clause #5 (by clausification #[4]): ∀ (a : b → Prop) (a_1 : b), Eq (Exists (skS.0 0 a) → skS.0 0 a a_1) False
% 3.46/3.70  Clause #6 (by clausification #[5]): ∀ (a : b → Prop), Eq (Exists (skS.0 0 a)) True
% 3.46/3.70  Clause #7 (by clausification #[5]): ∀ (a : b → Prop) (a_1 : b), Eq (skS.0 0 a a_1) False
% 3.46/3.70  Clause #8 (by clausification #[6]): ∀ (a : b → Prop) (a_1 : b), Eq (skS.0 0 a (skS.0 1 a a_1)) True
% 3.46/3.70  Clause #9 (by superposition #[7, 8]): Eq True False
% 3.46/3.70  Clause #10 (by clausification #[9]): False
% 3.46/3.70  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------