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

% Computer : n004.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 07:11:00 EDT 2023

% Result   : Theorem 3.47s 3.69s
% Output   : Proof 3.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL732^5 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n004.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri Aug 25 05:56:38 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.47/3.69  SZS status Theorem for theBenchmark.p
% 3.47/3.69  SZS output start Proof for theBenchmark.p
% 3.47/3.69  Clause #0 (by assumption #[]): Eq
% 3.47/3.69    (Not
% 3.47/3.69      (((b → Prop) → Exists fun Xy0 => (Exists fun Xx0 => p Xx0) → p y) →
% 3.47/3.69        Exists fun Xf => (b → Prop) → (Exists fun Xx0 => p Xx0) → p y))
% 3.47/3.69    True
% 3.47/3.69  Clause #1 (by betaEtaReduce #[0]): Eq (Not (((b → Prop) → Exists fun Xy0 => Exists p → p y) → Exists fun Xf => (b → Prop) → Exists p → p y)) True
% 3.47/3.69  Clause #2 (by clausification #[1]): Eq (((b → Prop) → Exists fun Xy0 => Exists p → p y) → Exists fun Xf => (b → Prop) → Exists p → p y) False
% 3.47/3.69  Clause #3 (by clausification #[2]): Eq ((b → Prop) → Exists fun Xy0 => Exists p → p y) True
% 3.47/3.69  Clause #4 (by clausification #[2]): Eq (Exists fun Xf => (b → Prop) → Exists p → p y) False
% 3.47/3.69  Clause #5 (by clausification #[3]): (b → Prop) → Eq (Exists fun Xy0 => Exists p → p y) True
% 3.47/3.69  Clause #6 (by clausification #[5]): b → Eq (Exists p → p y) True
% 3.47/3.69  Clause #7 (by clausification #[6]): Or (Eq (Exists p) False) (Eq (p y) True)
% 3.47/3.69  Clause #8 (by clausification #[7]): ∀ (a : Iota), Or (Eq (p y) True) (Eq (p a) False)
% 3.47/3.69  Clause #9 (by clausification #[4]): ((b → Prop) → b) → Eq ((b → Prop) → Exists p → p y) False
% 3.47/3.69  Clause #10 (by clausification #[9]): (b → Prop) → Eq (Not (Exists p → p y)) True
% 3.47/3.69  Clause #11 (by clausification #[10]): Eq (Exists p → p y) False
% 3.47/3.69  Clause #12 (by clausification #[11]): Eq (Exists p) True
% 3.47/3.69  Clause #13 (by clausification #[11]): Eq (p y) False
% 3.47/3.69  Clause #14 (by clausification #[12]): ∀ (a : Iota), Eq (p (skS.0 2 a)) True
% 3.47/3.69  Clause #15 (by superposition #[14, 8]): Or (Eq (p y) True) (Eq True False)
% 3.47/3.69  Clause #16 (by clausification #[15]): Eq (p y) True
% 3.47/3.69  Clause #17 (by superposition #[16, 13]): Eq True False
% 3.47/3.69  Clause #18 (by clausification #[17]): False
% 3.47/3.69  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------