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

% Computer : n004.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:18 EDT 2023

% Result   : Theorem 3.79s 4.00s
% Output   : Proof 3.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN926+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/0.13  % Command    : duper %s
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat Aug 26 19:39:22 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.79/4.00  SZS status Theorem for theBenchmark.p
% 3.79/4.00  SZS output start Proof for theBenchmark.p
% 3.79/4.00  Clause #0 (by assumption #[]): Eq (Not ((Exists fun X => And (p X) (q X)) → And (Exists fun X => p X) (Exists fun X => q X))) True
% 3.79/4.00  Clause #1 (by betaEtaReduce #[0]): Eq (Not ((Exists fun X => And (p X) (q X)) → And (Exists p) (Exists q))) True
% 3.79/4.00  Clause #2 (by clausification #[1]): Eq ((Exists fun X => And (p X) (q X)) → And (Exists p) (Exists q)) False
% 3.79/4.00  Clause #3 (by clausification #[2]): Eq (Exists fun X => And (p X) (q X)) True
% 3.79/4.00  Clause #4 (by clausification #[2]): Eq (And (Exists p) (Exists q)) False
% 3.79/4.00  Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (And (p (skS.0 0 a)) (q (skS.0 0 a))) True
% 3.79/4.00  Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (q (skS.0 0 a)) True
% 3.79/4.00  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (p (skS.0 0 a)) True
% 3.79/4.00  Clause #8 (by clausification #[4]): Or (Eq (Exists p) False) (Eq (Exists q) False)
% 3.79/4.00  Clause #9 (by clausification #[8]): ∀ (a : Iota), Or (Eq (Exists q) False) (Eq (p a) False)
% 3.79/4.00  Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Or (Eq (p a) False) (Eq (q a_1) False)
% 3.79/4.00  Clause #11 (by superposition #[10, 7]): ∀ (a : Iota), Or (Eq (q a) False) (Eq False True)
% 3.79/4.00  Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (q a) False
% 3.79/4.00  Clause #13 (by superposition #[12, 6]): Eq False True
% 3.79/4.00  Clause #14 (by clausification #[13]): False
% 3.79/4.00  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------