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

% Computer : n023.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:25 EDT 2023

% Result   : Theorem 3.34s 3.52s
% Output   : Proof 3.34s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN362+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13  % Command    : duper %s
% 0.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sat Aug 26 19:42:56 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 3.34/3.52  SZS status Theorem for theBenchmark.p
% 3.34/3.52  SZS output start Proof for theBenchmark.p
% 3.34/3.52  Clause #0 (by assumption #[]): Eq
% 3.34/3.52    (Not
% 3.34/3.52      (And (∀ (Y : Iota), Exists fun W => big_r Y W) (Exists fun Z => ∀ (X : Iota), big_p X → Not (big_r Z X)) →
% 3.34/3.52        Exists fun X => Not (big_p X)))
% 3.34/3.52    True
% 3.34/3.52  Clause #1 (by betaEtaReduce #[0]): Eq
% 3.34/3.52    (Not
% 3.34/3.52      (And (∀ (Y : Iota), Exists (big_r Y)) (Exists fun Z => ∀ (X : Iota), big_p X → Not (big_r Z X)) →
% 3.34/3.52        Exists fun X => Not (big_p X)))
% 3.34/3.52    True
% 3.34/3.52  Clause #2 (by clausification #[1]): Eq
% 3.34/3.52    (And (∀ (Y : Iota), Exists (big_r Y)) (Exists fun Z => ∀ (X : Iota), big_p X → Not (big_r Z X)) →
% 3.34/3.52      Exists fun X => Not (big_p X))
% 3.34/3.52    False
% 3.34/3.52  Clause #3 (by clausification #[2]): Eq (And (∀ (Y : Iota), Exists (big_r Y)) (Exists fun Z => ∀ (X : Iota), big_p X → Not (big_r Z X))) True
% 3.34/3.52  Clause #4 (by clausification #[2]): Eq (Exists fun X => Not (big_p X)) False
% 3.34/3.52  Clause #5 (by clausification #[3]): Eq (Exists fun Z => ∀ (X : Iota), big_p X → Not (big_r Z X)) True
% 3.34/3.52  Clause #6 (by clausification #[3]): Eq (∀ (Y : Iota), Exists (big_r Y)) True
% 3.34/3.52  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (∀ (X : Iota), big_p X → Not (big_r (skS.0 0 a) X)) True
% 3.34/3.52  Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Eq (big_p a → Not (big_r (skS.0 0 a_1) a)) True
% 3.34/3.52  Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (big_p a) False) (Eq (Not (big_r (skS.0 0 a_1) a)) True)
% 3.34/3.52  Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Or (Eq (big_p a) False) (Eq (big_r (skS.0 0 a_1) a) False)
% 3.34/3.52  Clause #11 (by clausification #[6]): ∀ (a : Iota), Eq (Exists (big_r a)) True
% 3.34/3.52  Clause #12 (by clausification #[11]): ∀ (a a_1 : Iota), Eq (big_r a (skS.0 1 a a_1)) True
% 3.34/3.52  Clause #13 (by clausification #[4]): ∀ (a : Iota), Eq (Not (big_p a)) False
% 3.34/3.52  Clause #14 (by clausification #[13]): ∀ (a : Iota), Eq (big_p a) True
% 3.34/3.52  Clause #15 (by backward demodulation #[14, 10]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (big_r (skS.0 0 a) a_1) False)
% 3.34/3.52  Clause #16 (by clausification #[15]): ∀ (a a_1 : Iota), Eq (big_r (skS.0 0 a) a_1) False
% 3.34/3.52  Clause #17 (by superposition #[16, 12]): Eq False True
% 3.34/3.52  Clause #18 (by clausification #[17]): False
% 3.34/3.52  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------