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

% Computer : n007.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:44:09 EDT 2023

% Result   : Theorem 3.23s 3.57s
% Output   : Proof 3.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU858^5 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.13  % Command    : duper %s
% 0.15/0.34  % Computer : n007.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Wed Aug 23 19:05:09 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 3.23/3.57  SZS status Theorem for theBenchmark.p
% 3.23/3.57  SZS output start Proof for theBenchmark.p
% 3.23/3.57  Clause #0 (by assumption #[]): Eq
% 3.23/3.57    (Not
% 3.23/3.57      (∀ (Xw : (a → Prop) → Prop),
% 3.23/3.57        And (Xw fun Xx => False) (∀ (Xr : a → Prop) (Xx : a), Xw Xr → Xw fun Xt => Or (Xr Xt) (Eq Xt Xx)) →
% 3.23/3.57          Xw fun Xx => False))
% 3.23/3.57    True
% 3.23/3.57  Clause #1 (by clausification #[0]): Eq
% 3.23/3.57    (∀ (Xw : (a → Prop) → Prop),
% 3.23/3.57      And (Xw fun Xx => False) (∀ (Xr : a → Prop) (Xx : a), Xw Xr → Xw fun Xt => Or (Xr Xt) (Eq Xt Xx)) →
% 3.23/3.57        Xw fun Xx => False)
% 3.23/3.57    False
% 3.23/3.57  Clause #2 (by clausification #[1]): ∀ (a_1 : (a → Prop) → Prop),
% 3.23/3.57    Eq
% 3.23/3.57      (Not
% 3.23/3.57        (And (skS.0 0 a_1 fun Xx => False)
% 3.23/3.57            (∀ (Xr : a → Prop) (Xx : a), skS.0 0 a_1 Xr → skS.0 0 a_1 fun Xt => Or (Xr Xt) (Eq Xt Xx)) →
% 3.23/3.57          skS.0 0 a_1 fun Xx => False))
% 3.23/3.57      True
% 3.23/3.57  Clause #3 (by clausification #[2]): ∀ (a_1 : (a → Prop) → Prop),
% 3.23/3.57    Eq
% 3.23/3.57      (And (skS.0 0 a_1 fun Xx => False)
% 3.23/3.57          (∀ (Xr : a → Prop) (Xx : a), skS.0 0 a_1 Xr → skS.0 0 a_1 fun Xt => Or (Xr Xt) (Eq Xt Xx)) →
% 3.23/3.57        skS.0 0 a_1 fun Xx => False)
% 3.23/3.57      False
% 3.23/3.57  Clause #4 (by clausification #[3]): ∀ (a_1 : (a → Prop) → Prop),
% 3.23/3.57    Eq
% 3.23/3.57      (And (skS.0 0 a_1 fun Xx => False)
% 3.23/3.57        (∀ (Xr : a → Prop) (Xx : a), skS.0 0 a_1 Xr → skS.0 0 a_1 fun Xt => Or (Xr Xt) (Eq Xt Xx)))
% 3.23/3.57      True
% 3.23/3.57  Clause #5 (by clausification #[3]): ∀ (a_1 : (a → Prop) → Prop), Eq (skS.0 0 a_1 fun Xx => False) False
% 3.23/3.57  Clause #7 (by clausification #[4]): ∀ (a_1 : (a → Prop) → Prop), Eq (skS.0 0 a_1 fun Xx => False) True
% 3.23/3.57  Clause #11 (by superposition #[7, 5]): Eq True False
% 3.23/3.57  Clause #14 (by clausification #[11]): False
% 3.23/3.57  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------