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

% Computer : n013.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:04 EDT 2023

% Result   : Theorem 3.58s 3.77s
% Output   : Proof 3.58s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYO289^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.36  % Computer : n013.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.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sat Aug 26 04:58:17 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 3.58/3.77  SZS status Theorem for theBenchmark.p
% 3.58/3.77  SZS output start Proof for theBenchmark.p
% 3.58/3.77  Clause #0 (by assumption #[]): Eq (Not (∀ (Xr : Iota → Iota → Prop) (Xy : Iota), (∀ (Xp : Iota → Prop), Xp Xy) → Exists fun Xx => Xr Xx Xy)) True
% 3.58/3.77  Clause #1 (by clausification #[0]): Eq (∀ (Xr : Iota → Iota → Prop) (Xy : Iota), (∀ (Xp : Iota → Prop), Xp Xy) → Exists fun Xx => Xr Xx Xy) False
% 3.58/3.77  Clause #2 (by clausification #[1]): ∀ (a : Iota → Iota → Prop),
% 3.58/3.77    Eq (Not (∀ (Xy : Iota), (∀ (Xp : Iota → Prop), Xp Xy) → Exists fun Xx => skS.0 0 a Xx Xy)) True
% 3.58/3.77  Clause #3 (by clausification #[2]): ∀ (a : Iota → Iota → Prop), Eq (∀ (Xy : Iota), (∀ (Xp : Iota → Prop), Xp Xy) → Exists fun Xx => skS.0 0 a Xx Xy) False
% 3.58/3.77  Clause #4 (by clausification #[3]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota),
% 3.58/3.77    Eq (Not ((∀ (Xp : Iota → Prop), Xp (skS.0 1 a a_1)) → Exists fun Xx => skS.0 0 a Xx (skS.0 1 a a_1))) True
% 3.58/3.77  Clause #5 (by clausification #[4]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota),
% 3.58/3.77    Eq ((∀ (Xp : Iota → Prop), Xp (skS.0 1 a a_1)) → Exists fun Xx => skS.0 0 a Xx (skS.0 1 a a_1)) False
% 3.58/3.77  Clause #6 (by clausification #[5]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota), Eq (∀ (Xp : Iota → Prop), Xp (skS.0 1 a a_1)) True
% 3.58/3.77  Clause #8 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 : Iota → Iota → Prop) (a_2 : Iota), Eq (a (skS.0 1 a_1 a_2)) True
% 3.58/3.77  Clause #12 (by fluidSup #[8, 8]): ∀ (a : Prop), Eq ((fun _ => a) True) True
% 3.58/3.77  Clause #19 (by betaEtaReduce #[12]): ∀ (a : Prop), Eq a True
% 3.58/3.77  Clause #20 (by falseElim #[19]): False
% 3.58/3.77  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------