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

% Computer : n029.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:36 EDT 2023

% Result   : Theorem 3.47s 3.89s
% Output   : Proof 3.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : SYO133^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15  % Command    : duper %s
% 0.16/0.37  % Computer : n029.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Sat Aug 26 05:10:39 EDT 2023
% 0.16/0.37  % CPUTime    : 
% 3.47/3.89  SZS status Theorem for theBenchmark.p
% 3.47/3.89  SZS output start Proof for theBenchmark.p
% 3.47/3.89  Clause #0 (by assumption #[]): Eq (Not (Exists fun Xy => ∀ (Xx : Iota), And (cP1 Xx) (cP1 Xy → cP2 Xx) → cP2 Xy)) True
% 3.47/3.89  Clause #1 (by clausification #[0]): Eq (Exists fun Xy => ∀ (Xx : Iota), And (cP1 Xx) (cP1 Xy → cP2 Xx) → cP2 Xy) False
% 3.47/3.89  Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (∀ (Xx : Iota), And (cP1 Xx) (cP1 a → cP2 Xx) → cP2 a) False
% 3.47/3.89  Clause #3 (by clausification #[2]): ∀ (a a_1 : Iota), Eq (Not (And (cP1 (skS.0 0 a a_1)) (cP1 a → cP2 (skS.0 0 a a_1)) → cP2 a)) True
% 3.47/3.89  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (And (cP1 (skS.0 0 a a_1)) (cP1 a → cP2 (skS.0 0 a a_1)) → cP2 a) False
% 3.47/3.89  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (And (cP1 (skS.0 0 a a_1)) (cP1 a → cP2 (skS.0 0 a a_1))) True
% 3.47/3.89  Clause #6 (by clausification #[4]): ∀ (a : Iota), Eq (cP2 a) False
% 3.47/3.89  Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (cP1 a → cP2 (skS.0 0 a a_1)) True
% 3.47/3.89  Clause #8 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (cP1 (skS.0 0 a a_1)) True
% 3.47/3.89  Clause #9 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (cP1 a) False) (Eq (cP2 (skS.0 0 a a_1)) True)
% 3.47/3.89  Clause #10 (by superposition #[8, 9]): ∀ (a a_1 a_2 : Iota), Or (Eq (cP2 (skS.0 0 (skS.0 0 a a_1) a_2)) True) (Eq False True)
% 3.47/3.89  Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), Eq (cP2 (skS.0 0 (skS.0 0 a a_1) a_2)) True
% 3.47/3.89  Clause #12 (by superposition #[11, 6]): Eq True False
% 3.47/3.89  Clause #13 (by clausification #[12]): False
% 3.47/3.89  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------