TSTP Solution File: SEU894^5 by Duper---1.0

View Problem - Process Solution

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

% Computer : n019.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:14 EDT 2023

% Result   : Theorem 3.68s 3.86s
% Output   : Proof 3.68s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : SEU894^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15  % Command    : duper %s
% 0.15/0.37  % Computer : n019.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 21:43:14 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 3.68/3.86  SZS status Theorem for theBenchmark.p
% 3.68/3.86  SZS output start Proof for theBenchmark.p
% 3.68/3.86  Clause #0 (by assumption #[]): Eq
% 3.68/3.86    (Not
% 3.68/3.86      (∀ (F : Iota → Iota),
% 3.68/3.86        Exists fun G =>
% 3.68/3.86          And (∀ (P : (Iota → Iota) → Prop), And (P F) (∀ (H : Iota → Iota), P H → P fun T => F (H T)) → P G)
% 3.68/3.86              (Exists fun X => And (Eq (G X) X) (∀ (Y : Iota), Eq (G Y) Y → Eq X Y)) →
% 3.68/3.86            Exists fun Y => Eq (F Y) Y))
% 3.68/3.86    True
% 3.68/3.86  Clause #1 (by clausification #[0]): Eq
% 3.68/3.86    (∀ (F : Iota → Iota),
% 3.68/3.86      Exists fun G =>
% 3.68/3.86        And (∀ (P : (Iota → Iota) → Prop), And (P F) (∀ (H : Iota → Iota), P H → P fun T => F (H T)) → P G)
% 3.68/3.86            (Exists fun X => And (Eq (G X) X) (∀ (Y : Iota), Eq (G Y) Y → Eq X Y)) →
% 3.68/3.86          Exists fun Y => Eq (F Y) Y)
% 3.68/3.86    False
% 3.68/3.86  Clause #2 (by clausification #[1]): ∀ (a : Iota → Iota),
% 3.68/3.86    Eq
% 3.68/3.86      (Not
% 3.68/3.86        (Exists fun G =>
% 3.68/3.86          And
% 3.68/3.86              (∀ (P : (Iota → Iota) → Prop),
% 3.68/3.86                And (P (skS.0 0 a)) (∀ (H : Iota → Iota), P H → P fun T => skS.0 0 a (H T)) → P G)
% 3.68/3.86              (Exists fun X => And (Eq (G X) X) (∀ (Y : Iota), Eq (G Y) Y → Eq X Y)) →
% 3.68/3.86            Exists fun Y => Eq (skS.0 0 a Y) Y))
% 3.68/3.86      True
% 3.68/3.86  Clause #3 (by clausification #[2]): ∀ (a : Iota → Iota),
% 3.68/3.86    Eq
% 3.68/3.86      (Exists fun G =>
% 3.68/3.86        And
% 3.68/3.86            (∀ (P : (Iota → Iota) → Prop),
% 3.68/3.86              And (P (skS.0 0 a)) (∀ (H : Iota → Iota), P H → P fun T => skS.0 0 a (H T)) → P G)
% 3.68/3.86            (Exists fun X => And (Eq (G X) X) (∀ (Y : Iota), Eq (G Y) Y → Eq X Y)) →
% 3.68/3.86          Exists fun Y => Eq (skS.0 0 a Y) Y)
% 3.68/3.86      False
% 3.68/3.86  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota → Iota),
% 3.68/3.86    Eq
% 3.68/3.86      (And
% 3.68/3.86          (∀ (P : (Iota → Iota) → Prop),
% 3.68/3.86            And (P (skS.0 0 a)) (∀ (H : Iota → Iota), P H → P fun T => skS.0 0 a (H T)) → P a_1)
% 3.68/3.86          (Exists fun X => And (Eq (a_1 X) X) (∀ (Y : Iota), Eq (a_1 Y) Y → Eq X Y)) →
% 3.68/3.86        Exists fun Y => Eq (skS.0 0 a Y) Y)
% 3.68/3.86      False
% 3.68/3.86  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota → Iota),
% 3.68/3.86    Eq
% 3.68/3.86      (And
% 3.68/3.86        (∀ (P : (Iota → Iota) → Prop),
% 3.68/3.86          And (P (skS.0 0 a)) (∀ (H : Iota → Iota), P H → P fun T => skS.0 0 a (H T)) → P a_1)
% 3.68/3.86        (Exists fun X => And (Eq (a_1 X) X) (∀ (Y : Iota), Eq (a_1 Y) Y → Eq X Y)))
% 3.68/3.86      True
% 3.68/3.86  Clause #6 (by clausification #[4]): ∀ (a : Iota → Iota), Eq (Exists fun Y => Eq (skS.0 0 a Y) Y) False
% 3.68/3.86  Clause #7 (by clausification #[5]): ∀ (a : Iota → Iota), Eq (Exists fun X => And (Eq (a X) X) (∀ (Y : Iota), Eq (a Y) Y → Eq X Y)) True
% 3.68/3.86  Clause #9 (by clausification #[7]): ∀ (a : Iota → Iota) (a_1 : Iota),
% 3.68/3.86    Eq (And (Eq (a (skS.0 1 a a_1)) (skS.0 1 a a_1)) (∀ (Y : Iota), Eq (a Y) Y → Eq (skS.0 1 a a_1) Y)) True
% 3.68/3.86  Clause #10 (by clausification #[9]): ∀ (a : Iota → Iota) (a_1 : Iota), Eq (∀ (Y : Iota), Eq (a Y) Y → Eq (skS.0 1 a a_1) Y) True
% 3.68/3.86  Clause #12 (by clausification #[10]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Eq (Eq (a a_1) a_1 → Eq (skS.0 1 a a_2) a_1) True
% 3.68/3.86  Clause #13 (by clausification #[12]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Or (Eq (Eq (a a_1) a_1) False) (Eq (Eq (skS.0 1 a a_2) a_1) True)
% 3.68/3.86  Clause #14 (by clausification #[13]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Or (Eq (Eq (skS.0 1 a a_1) a_2) True) (Ne (a a_2) a_2)
% 3.68/3.86  Clause #15 (by clausification #[14]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Or (Ne (a a_1) a_1) (Eq (skS.0 1 a a_2) a_1)
% 3.68/3.86  Clause #16 (by equality resolution #[15]): ∀ (a a_1 : Iota), Eq (skS.0 1 (fun x => x) a) a_1
% 3.68/3.86  Clause #46 (by superposition #[16, 16]): ∀ (a a_1 : Iota), Eq a a_1
% 3.68/3.86  Clause #59 (by clausification #[6]): ∀ (a : Iota → Iota) (a_1 : Iota), Eq (Eq (skS.0 0 a a_1) a_1) False
% 3.68/3.86  Clause #60 (by clausification #[59]): ∀ (a : Iota → Iota) (a_1 : Iota), Ne (skS.0 0 a a_1) a_1
% 3.68/3.86  Clause #61 (by forward contextual literal cutting #[60, 46]): False
% 3.68/3.86  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------