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

% Computer : n001.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:39 EDT 2023

% Result   : Theorem 3.41s 3.81s
% Output   : Proof 3.41s
% Verified : 
% SZS Type : -

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