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

% Computer : n005.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:13:29 EDT 2023

% Result   : Theorem 3.53s 3.75s
% Output   : Proof 3.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN970+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n005.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 17:06:38 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 3.53/3.75  SZS status Theorem for theBenchmark.p
% 3.53/3.75  SZS output start Proof for theBenchmark.p
% 3.53/3.75  Clause #0 (by assumption #[]): Eq (Not (∀ (A B : Iota), Exists fun X => Exists fun Y => (p X → r Y) → p A → r B)) True
% 3.53/3.75  Clause #1 (by clausification #[0]): Eq (∀ (A B : Iota), Exists fun X => Exists fun Y => (p X → r Y) → p A → r B) False
% 3.53/3.75  Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), Exists fun X => Exists fun Y => (p X → r Y) → p (skS.0 0 a) → r B)) True
% 3.53/3.75  Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (B : Iota), Exists fun X => Exists fun Y => (p X → r Y) → p (skS.0 0 a) → r B) False
% 3.53/3.75  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (Not (Exists fun X => Exists fun Y => (p X → r Y) → p (skS.0 0 a) → r (skS.0 1 a a_1))) True
% 3.53/3.75  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (Exists fun X => Exists fun Y => (p X → r Y) → p (skS.0 0 a) → r (skS.0 1 a a_1)) False
% 3.53/3.75  Clause #6 (by clausification #[5]): ∀ (a a_1 a_2 : Iota), Eq (Exists fun Y => (p a → r Y) → p (skS.0 0 a_1) → r (skS.0 1 a_1 a_2)) False
% 3.53/3.75  Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 a_3 : Iota), Eq ((p a → r a_1) → p (skS.0 0 a_2) → r (skS.0 1 a_2 a_3)) False
% 3.53/3.75  Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Eq (p a → r a_1) True
% 3.53/3.75  Clause #9 (by clausification #[7]): ∀ (a a_1 : Iota), Eq (p (skS.0 0 a) → r (skS.0 1 a a_1)) False
% 3.53/3.75  Clause #10 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (p a) False) (Eq (r a_1) True)
% 3.53/3.75  Clause #11 (by clausification #[9]): ∀ (a : Iota), Eq (p (skS.0 0 a)) True
% 3.53/3.75  Clause #12 (by clausification #[9]): ∀ (a a_1 : Iota), Eq (r (skS.0 1 a a_1)) False
% 3.53/3.75  Clause #13 (by superposition #[11, 10]): ∀ (a : Iota), Or (Eq True False) (Eq (r a) True)
% 3.53/3.75  Clause #14 (by clausification #[13]): ∀ (a : Iota), Eq (r a) True
% 3.53/3.75  Clause #15 (by superposition #[12, 14]): Eq True False
% 3.53/3.75  Clause #16 (by clausification #[15]): False
% 3.53/3.75  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------