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

% Computer : n006.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:06 EDT 2023

% Result   : Theorem 3.37s 3.65s
% Output   : Proof 3.37s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO301^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n006.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.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat Aug 26 07:45:52 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.37/3.65  SZS status Theorem for theBenchmark.p
% 3.37/3.65  SZS output start Proof for theBenchmark.p
% 3.37/3.65  Clause #0 (by assumption #[]): Eq (Not (cP (f b) → Exists fun Xs => Exists fun A => And (∀ (Xx : Iota), A Xx → cP Xx) (A (f Xs)))) True
% 3.37/3.65  Clause #1 (by clausification #[0]): Eq (cP (f b) → Exists fun Xs => Exists fun A => And (∀ (Xx : Iota), A Xx → cP Xx) (A (f Xs))) False
% 3.37/3.65  Clause #2 (by clausification #[1]): Eq (cP (f b)) True
% 3.37/3.65  Clause #3 (by clausification #[1]): Eq (Exists fun Xs => Exists fun A => And (∀ (Xx : Iota), A Xx → cP Xx) (A (f Xs))) False
% 3.37/3.65  Clause #4 (by clausification #[3]): ∀ (a : Iota), Eq (Exists fun A => And (∀ (Xx : Iota), A Xx → cP Xx) (A (f a))) False
% 3.37/3.65  Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (And (∀ (Xx : Iota), a Xx → cP Xx) (a (f a_1))) False
% 3.37/3.65  Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (∀ (Xx : Iota), a Xx → cP Xx) False) (Eq (a (f a_1)) False)
% 3.37/3.65  Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a (f a_1)) False) (Eq (Not (a (skS.0 0 a a_2) → cP (skS.0 0 a a_2))) True)
% 3.37/3.65  Clause #8 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a (f a_1)) False) (Eq (a (skS.0 0 a a_2) → cP (skS.0 0 a a_2)) False)
% 3.37/3.65  Clause #9 (by clausification #[8]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a (f a_1)) False) (Eq (a (skS.0 0 a a_2)) True)
% 3.37/3.65  Clause #10 (by clausification #[8]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a (f a_1)) False) (Eq (cP (skS.0 0 a a_2)) False)
% 3.37/3.65  Clause #11 (by superposition #[9, 2]): ∀ (a : Iota), Or (Eq ((fun x => cP x) (skS.0 0 (fun x => cP x) a)) True) (Eq False True)
% 3.37/3.65  Clause #21 (by superposition #[10, 2]): ∀ (a : Iota), Or (Eq (cP (skS.0 0 (fun x => cP x) a)) False) (Eq False True)
% 3.37/3.65  Clause #33 (by betaEtaReduce #[21]): ∀ (a : Iota), Or (Eq (cP (skS.0 0 cP a)) False) (Eq False True)
% 3.37/3.65  Clause #34 (by clausification #[33]): ∀ (a : Iota), Eq (cP (skS.0 0 cP a)) False
% 3.37/3.65  Clause #46 (by betaEtaReduce #[11]): ∀ (a : Iota), Or (Eq (cP (skS.0 0 cP a)) True) (Eq False True)
% 3.37/3.65  Clause #47 (by clausification #[46]): ∀ (a : Iota), Eq (cP (skS.0 0 cP a)) True
% 3.37/3.65  Clause #48 (by superposition #[47, 34]): Eq True False
% 3.37/3.65  Clause #54 (by clausification #[48]): False
% 3.37/3.65  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------