%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO145^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n008.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 04:21:39 EDT 2023

% Result   : Theorem 3.65s 3.83s
% Output   : Proof 3.65s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYO145^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.36  % Computer : n008.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sat Aug 26 03:31:02 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 3.65/3.83  SZS status Theorem for theBenchmark.p
% 3.65/3.83  SZS output start Proof for theBenchmark.p
% 3.65/3.83  Clause #0 (by assumption #[]): Eq
% 3.65/3.83    (Not
% 3.65/3.83      ((∀ (Xx : Iota), Exists fun Xy => cP Xx Xy) →
% 3.65/3.83        ∀ (Xx : Iota), Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP Xx Xy)))
% 3.65/3.83    True
% 3.65/3.83  Clause #1 (by betaEtaReduce #[0]): Eq (Not ((∀ (Xx : Iota), Exists (cP Xx)) → ∀ (Xx : Iota), Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP Xx Xy)))
% 3.65/3.83    True
% 3.65/3.83  Clause #2 (by clausification #[1]): Eq ((∀ (Xx : Iota), Exists (cP Xx)) → ∀ (Xx : Iota), Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP Xx Xy)) False
% 3.65/3.83  Clause #3 (by clausification #[2]): Eq (∀ (Xx : Iota), Exists (cP Xx)) True
% 3.65/3.83  Clause #4 (by clausification #[2]): Eq (∀ (Xx : Iota), Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP Xx Xy)) False
% 3.65/3.83  Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (Exists (cP a)) True
% 3.65/3.83  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (cP a (skS.0 0 a a_1)) True
% 3.65/3.83  Clause #7 (by clausification #[4]): ∀ (a : Iota), Eq (Not (Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP (skS.0 1 a) Xy))) True
% 3.65/3.83  Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP (skS.0 1 a) Xy)) False
% 3.65/3.83  Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (Exists fun Xz => And (cP a Xz) (cP (skS.0 1 a_1) a)) False
% 3.65/3.83  Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : Iota), Eq (And (cP a a_1) (cP (skS.0 1 a_2) a)) False
% 3.65/3.83  Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), Or (Eq (cP a a_1) False) (Eq (cP (skS.0 1 a_2) a) False)
% 3.65/3.83  Clause #12 (by superposition #[11, 6]): ∀ (a a_1 : Iota), Or (Eq (cP (skS.0 1 a) a_1) False) (Eq False True)
% 3.65/3.83  Clause #13 (by clausification #[12]): ∀ (a a_1 : Iota), Eq (cP (skS.0 1 a) a_1) False
% 3.65/3.83  Clause #14 (by superposition #[13, 6]): Eq False True
% 3.65/3.83  Clause #15 (by clausification #[14]): False
% 3.65/3.83  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------