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

% Computer : n019.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:59 EDT 2023

% Result   : Theorem 3.54s 3.74s
% Output   : Proof 3.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO258^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 00:14:59 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 3.54/3.74  SZS status Theorem for theBenchmark.p
% 3.54/3.74  SZS output start Proof for theBenchmark.p
% 3.54/3.74  Clause #0 (by assumption #[]): Eq
% 3.54/3.74    (Not
% 3.54/3.74      (And (cP a b) (∀ (E : Iota → Prop), cQ b E) →
% 3.54/3.74        Exists fun A => ∀ (Xg : Iota), A Xg → And (Exists fun Xx => And (cP Xg Xx) (cQ Xx A)) (A a)))
% 3.54/3.74    True
% 3.54/3.74  Clause #1 (by clausification #[0]): Eq
% 3.54/3.74    (And (cP a b) (∀ (E : Iota → Prop), cQ b E) →
% 3.54/3.74      Exists fun A => ∀ (Xg : Iota), A Xg → And (Exists fun Xx => And (cP Xg Xx) (cQ Xx A)) (A a))
% 3.54/3.74    False
% 3.54/3.74  Clause #3 (by clausification #[1]): Eq (Exists fun A => ∀ (Xg : Iota), A Xg → And (Exists fun Xx => And (cP Xg Xx) (cQ Xx A)) (A a)) False
% 3.54/3.74  Clause #7 (by clausification #[3]): ∀ (a_1 : Iota → Prop), Eq (∀ (Xg : Iota), a_1 Xg → And (Exists fun Xx => And (cP Xg Xx) (cQ Xx a_1)) (a_1 a)) False
% 3.54/3.74  Clause #8 (by clausification #[7]): ∀ (a_1 : Iota → Prop) (a_2 : Iota),
% 3.54/3.74    Eq (Not (a_1 (skS.0 0 a_1 a_2) → And (Exists fun Xx => And (cP (skS.0 0 a_1 a_2) Xx) (cQ Xx a_1)) (a_1 a))) True
% 3.54/3.74  Clause #9 (by clausification #[8]): ∀ (a_1 : Iota → Prop) (a_2 : Iota),
% 3.54/3.74    Eq (a_1 (skS.0 0 a_1 a_2) → And (Exists fun Xx => And (cP (skS.0 0 a_1 a_2) Xx) (cQ Xx a_1)) (a_1 a)) False
% 3.54/3.74  Clause #10 (by clausification #[9]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (a (skS.0 0 a a_1)) True
% 3.54/3.74  Clause #15 (by fluidSup #[10, 10]): ∀ (a : Prop), Eq ((fun _ => a) True) True
% 3.54/3.74  Clause #24 (by betaEtaReduce #[15]): ∀ (a : Prop), Eq a True
% 3.54/3.74  Clause #25 (by falseElim #[24]): False
% 3.54/3.74  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------