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

% Computer : n007.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 : Thu Aug 31 16:44:13 EDT 2023

% Result   : Theorem 3.70s 3.91s
% Output   : Proof 3.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : SEU888^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15  % Command    : duper %s
% 0.15/0.37  % Computer : n007.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Wed Aug 23 19:19:24 EDT 2023
% 0.15/0.38  % CPUTime    : 
% 3.70/3.91  SZS status Theorem for theBenchmark.p
% 3.70/3.91  SZS output start Proof for theBenchmark.p
% 3.70/3.91  Clause #0 (by assumption #[]): Eq (Not (Or (Eq z (g x)) (Eq z (g y)) → Exists fun Xt => And (Or (Eq Xt x) (Eq Xt y)) (Eq z (g Xt)))) True
% 3.70/3.91  Clause #1 (by clausification #[0]): Eq (Or (Eq z (g x)) (Eq z (g y)) → Exists fun Xt => And (Or (Eq Xt x) (Eq Xt y)) (Eq z (g Xt))) False
% 3.70/3.91  Clause #2 (by clausification #[1]): Eq (Or (Eq z (g x)) (Eq z (g y))) True
% 3.70/3.91  Clause #3 (by clausification #[1]): Eq (Exists fun Xt => And (Or (Eq Xt x) (Eq Xt y)) (Eq z (g Xt))) False
% 3.70/3.91  Clause #4 (by clausification #[2]): Or (Eq (Eq z (g x)) True) (Eq (Eq z (g y)) True)
% 3.70/3.91  Clause #5 (by clausification #[4]): Or (Eq (Eq z (g y)) True) (Eq z (g x))
% 3.70/3.91  Clause #6 (by clausification #[5]): Or (Eq z (g x)) (Eq z (g y))
% 3.70/3.91  Clause #7 (by clausification #[3]): ∀ (a_1 : b), Eq (And (Or (Eq a_1 x) (Eq a_1 y)) (Eq z (g a_1))) False
% 3.70/3.91  Clause #8 (by clausification #[7]): ∀ (a_1 : b), Or (Eq (Or (Eq a_1 x) (Eq a_1 y)) False) (Eq (Eq z (g a_1)) False)
% 3.70/3.91  Clause #9 (by clausification #[8]): ∀ (a_1 : b), Or (Eq (Eq z (g a_1)) False) (Eq (Eq a_1 y) False)
% 3.70/3.91  Clause #10 (by clausification #[8]): ∀ (a_1 : b), Or (Eq (Eq z (g a_1)) False) (Eq (Eq a_1 x) False)
% 3.70/3.91  Clause #11 (by clausification #[9]): ∀ (a_1 : b), Or (Eq (Eq a_1 y) False) (Ne z (g a_1))
% 3.70/3.91  Clause #12 (by clausification #[11]): ∀ (a_1 : b), Or (Ne z (g a_1)) (Ne a_1 y)
% 3.70/3.91  Clause #13 (by destructive equality resolution #[12]): Ne z (g y)
% 3.70/3.91  Clause #14 (by backward contextual literal cutting #[13, 6]): Eq z (g x)
% 3.70/3.91  Clause #15 (by clausification #[10]): ∀ (a_1 : b), Or (Eq (Eq a_1 x) False) (Ne z (g a_1))
% 3.70/3.91  Clause #16 (by clausification #[15]): ∀ (a_1 : b), Or (Ne z (g a_1)) (Ne a_1 x)
% 3.70/3.91  Clause #17 (by destructive equality resolution #[16]): Ne z (g x)
% 3.70/3.91  Clause #18 (by forward demodulation #[17, 14]): Ne z z
% 3.70/3.91  Clause #19 (by eliminate resolved literals #[18]): False
% 3.70/3.91  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------