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

% Computer : n027.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.50s 3.74s
% Output   : Proof 3.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYO293^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15  % Command    : duper %s
% 0.15/0.36  % Computer : n027.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sat Aug 26 05:49:34 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 3.50/3.74  SZS status Theorem for theBenchmark.p
% 3.50/3.74  SZS output start Proof for theBenchmark.p
% 3.50/3.74  Clause #0 (by assumption #[]): Eq (Not (Exists fun A => ∀ (Xx Xy : Iota), And (A Xx) (A Xy) → cP Xx Xy)) True
% 3.50/3.74  Clause #1 (by clausification #[0]): Eq (Exists fun A => ∀ (Xx Xy : Iota), And (A Xx) (A Xy) → cP Xx Xy) False
% 3.50/3.74  Clause #2 (by clausification #[1]): ∀ (a : Iota → Prop), Eq (∀ (Xx Xy : Iota), And (a Xx) (a Xy) → cP Xx Xy) False
% 3.50/3.74  Clause #3 (by clausification #[2]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (Not (∀ (Xy : Iota), And (a (skS.0 0 a a_1)) (a Xy) → cP (skS.0 0 a a_1) Xy)) True
% 3.50/3.74  Clause #4 (by clausification #[3]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (∀ (Xy : Iota), And (a (skS.0 0 a a_1)) (a Xy) → cP (skS.0 0 a a_1) Xy) False
% 3.50/3.74  Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota),
% 3.50/3.74    Eq (Not (And (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2)) → cP (skS.0 0 a a_1) (skS.0 1 a a_1 a_2))) True
% 3.50/3.74  Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota),
% 3.50/3.74    Eq (And (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2)) → cP (skS.0 0 a a_1) (skS.0 1 a a_1 a_2)) False
% 3.50/3.74  Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Eq (And (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2))) True
% 3.50/3.74  Clause #9 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Eq (a (skS.0 1 a a_1 a_2)) True
% 3.50/3.74  Clause #14 (by fluidSup #[9, 9]): ∀ (a : Prop), Eq ((fun _ => a) True) True
% 3.50/3.74  Clause #22 (by betaEtaReduce #[14]): ∀ (a : Prop), Eq a True
% 3.50/3.74  Clause #23 (by falseElim #[22]): False
% 3.50/3.74  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------