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

% Computer : n006.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:21 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU934^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : duper %s
% 0.14/0.35  % Computer : n006.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Wed Aug 23 19:40:53 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.41/3.60  SZS status Theorem for theBenchmark.p
% 3.41/3.60  SZS output start Proof for theBenchmark.p
% 3.41/3.60  Clause #0 (by assumption #[]): Eq (Not (∀ (Xx Xy : Iota), (Eq (fun Y => Eq Y Xx) fun Y => Eq Y Xy) → Eq Xx Xy)) True
% 3.41/3.60  Clause #1 (by clausification #[0]): Eq (∀ (Xx Xy : Iota), (Eq (fun Y => Eq Y Xx) fun Y => Eq Y Xy) → Eq Xx Xy) False
% 3.41/3.60  Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (Not (∀ (Xy : Iota), (Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y Xy) → Eq (skS.0 0 a) Xy)) True
% 3.41/3.60  Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (Xy : Iota), (Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y Xy) → Eq (skS.0 0 a) Xy) False
% 3.41/3.60  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota),
% 3.41/3.60    Eq (Not ((Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y (skS.0 1 a a_1)) → Eq (skS.0 0 a) (skS.0 1 a a_1))) True
% 3.41/3.60  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota),
% 3.41/3.60    Eq ((Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y (skS.0 1 a a_1)) → Eq (skS.0 0 a) (skS.0 1 a a_1)) False
% 3.41/3.60  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y (skS.0 1 a a_1)) True
% 3.41/3.60  Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) False
% 3.41/3.60  Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (fun Y => Eq Y (skS.0 0 a)) fun Y => Eq Y (skS.0 1 a a_1)
% 3.41/3.60  Clause #9 (by argument congruence #[8]): ∀ (a a_1 a_2 : Iota), Eq ((fun Y => Eq Y (skS.0 0 a)) a_1) ((fun Y => Eq Y (skS.0 1 a a_2)) a_1)
% 3.41/3.60  Clause #11 (by clausification #[7]): ∀ (a a_1 : Iota), Ne (skS.0 0 a) (skS.0 1 a a_1)
% 3.41/3.60  Clause #13 (by betaEtaReduce #[9]): ∀ (a a_1 a_2 : Iota), Eq (Eq a (skS.0 0 a_1)) (Eq a (skS.0 1 a_1 a_2))
% 3.41/3.60  Clause #16 (by eqHoist #[13]): ∀ (a a_1 a_2 : Iota), Or (Eq (Eq a (skS.0 0 a_1)) False) (Eq a (skS.0 1 a_1 a_2))
% 3.41/3.60  Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 : Iota), Or (Eq a (skS.0 1 a_1 a_2)) (Ne a (skS.0 0 a_1))
% 3.41/3.60  Clause #18 (by destructive equality resolution #[17]): ∀ (a a_1 : Iota), Eq (skS.0 0 a) (skS.0 1 a a_1)
% 3.41/3.60  Clause #19 (by forward contextual literal cutting #[18, 11]): False
% 3.41/3.60  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------