%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYN384+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n002.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 02:11:33 EDT 2023

% Result   : Theorem 3.99s 4.15s
% Output   : Proof 3.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN384+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.12  % Command    : duper %s
% 0.12/0.32  % Computer : n002.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Sat Aug 26 17:31:48 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 3.99/4.15  SZS status Theorem for theBenchmark.p
% 3.99/4.15  SZS output start Proof for theBenchmark.p
% 3.99/4.15  Clause #0 (by assumption #[]): Eq (Not (∀ (Z : Iota), Exists fun X => Exists fun Y => ∀ (U : Iota), big_p X Y Z → big_p U X X)) True
% 3.99/4.15  Clause #1 (by clausification #[0]): Eq (∀ (Z : Iota), Exists fun X => Exists fun Y => ∀ (U : Iota), big_p X Y Z → big_p U X X) False
% 3.99/4.15  Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (Not (Exists fun X => Exists fun Y => ∀ (U : Iota), big_p X Y (skS.0 0 a) → big_p U X X)) True
% 3.99/4.15  Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun X => Exists fun Y => ∀ (U : Iota), big_p X Y (skS.0 0 a) → big_p U X X) False
% 3.99/4.15  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (Exists fun Y => ∀ (U : Iota), big_p a Y (skS.0 0 a_1) → big_p U a a) False
% 3.99/4.15  Clause #5 (by clausification #[4]): ∀ (a a_1 a_2 : Iota), Eq (∀ (U : Iota), big_p a a_1 (skS.0 0 a_2) → big_p U a a) False
% 3.99/4.15  Clause #6 (by clausification #[5]): ∀ (a a_1 a_2 a_3 : Iota), Eq (Not (big_p a a_1 (skS.0 0 a_2) → big_p (skS.0 1 a a_1 a_2 a_3) a a)) True
% 3.99/4.15  Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 a_3 : Iota), Eq (big_p a a_1 (skS.0 0 a_2) → big_p (skS.0 1 a a_1 a_2 a_3) a a) False
% 3.99/4.15  Clause #8 (by clausification #[7]): ∀ (a a_1 a_2 : Iota), Eq (big_p a a_1 (skS.0 0 a_2)) True
% 3.99/4.15  Clause #9 (by clausification #[7]): ∀ (a a_1 a_2 a_3 : Iota), Eq (big_p (skS.0 1 a a_1 a_2 a_3) a a) False
% 3.99/4.15  Clause #10 (by superposition #[9, 8]): Eq False True
% 3.99/4.15  Clause #11 (by clausification #[10]): False
% 3.99/4.15  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------