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

% Computer : n025.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:19 EDT 2023

% Result   : Theorem 3.62s 3.80s
% Output   : Proof 3.62s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU926^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n025.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 17:53:50 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.62/3.80  SZS status Theorem for theBenchmark.p
% 3.62/3.80  SZS output start Proof for theBenchmark.p
% 3.62/3.80  Clause #0 (by assumption #[]): Eq
% 3.62/3.80    (Not
% 3.62/3.80      (∀ (P : Iota → Prop),
% 3.62/3.80        Exists fun M => ∀ (G : Iota → Iota), M G → And (M fun Z => G (G Z)) (∀ (Y : Iota), P Y → P (G Y))))
% 3.62/3.80    True
% 3.62/3.80  Clause #1 (by clausification #[0]): Eq
% 3.62/3.80    (∀ (P : Iota → Prop),
% 3.62/3.80      Exists fun M => ∀ (G : Iota → Iota), M G → And (M fun Z => G (G Z)) (∀ (Y : Iota), P Y → P (G Y)))
% 3.62/3.80    False
% 3.62/3.80  Clause #2 (by clausification #[1]): ∀ (a : Iota → Prop),
% 3.62/3.80    Eq
% 3.62/3.80      (Not
% 3.62/3.80        (Exists fun M =>
% 3.62/3.80          ∀ (G : Iota → Iota), M G → And (M fun Z => G (G Z)) (∀ (Y : Iota), skS.0 0 a Y → skS.0 0 a (G Y))))
% 3.62/3.80      True
% 3.62/3.80  Clause #3 (by clausification #[2]): ∀ (a : Iota → Prop),
% 3.62/3.80    Eq (Exists fun M => ∀ (G : Iota → Iota), M G → And (M fun Z => G (G Z)) (∀ (Y : Iota), skS.0 0 a Y → skS.0 0 a (G Y)))
% 3.62/3.80      False
% 3.62/3.80  Clause #4 (by clausification #[3]): ∀ (a : (Iota → Iota) → Prop) (a_1 : Iota → Prop),
% 3.62/3.80    Eq (∀ (G : Iota → Iota), a G → And (a fun Z => G (G Z)) (∀ (Y : Iota), skS.0 0 a_1 Y → skS.0 0 a_1 (G Y))) False
% 3.62/3.80  Clause #5 (by clausification #[4]): ∀ (a : (Iota → Iota) → Prop) (a_1 : Iota → Prop) (a_2 : Iota → Iota),
% 3.62/3.80    Eq
% 3.62/3.80      (Not
% 3.62/3.80        (a (skS.0 1 a a_1 a_2) →
% 3.62/3.80          And (a fun Z => skS.0 1 a a_1 a_2 (skS.0 1 a a_1 a_2 Z))
% 3.62/3.80            (∀ (Y : Iota), skS.0 0 a_1 Y → skS.0 0 a_1 (skS.0 1 a a_1 a_2 Y))))
% 3.62/3.80      True
% 3.62/3.80  Clause #6 (by clausification #[5]): ∀ (a : (Iota → Iota) → Prop) (a_1 : Iota → Prop) (a_2 : Iota → Iota),
% 3.62/3.80    Eq
% 3.62/3.80      (a (skS.0 1 a a_1 a_2) →
% 3.62/3.80        And (a fun Z => skS.0 1 a a_1 a_2 (skS.0 1 a a_1 a_2 Z))
% 3.62/3.80          (∀ (Y : Iota), skS.0 0 a_1 Y → skS.0 0 a_1 (skS.0 1 a a_1 a_2 Y)))
% 3.62/3.80      False
% 3.62/3.80  Clause #7 (by clausification #[6]): ∀ (a : (Iota → Iota) → Prop) (a_1 : Iota → Prop) (a_2 : Iota → Iota), Eq (a (skS.0 1 a a_1 a_2)) True
% 3.62/3.80  Clause #12 (by fluidSup #[7, 7]): ∀ (a : Prop), Eq ((fun _ => a) True) True
% 3.62/3.80  Clause #20 (by betaEtaReduce #[12]): ∀ (a : Prop), Eq a True
% 3.62/3.80  Clause #21 (by falseElim #[20]): False
% 3.62/3.80  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------