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

View Problem - Process Solution

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

% Computer : n009.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:52 EDT 2023

% Result   : Theorem 3.53s 3.74s
% Output   : Proof 3.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYO216^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14  % Command    : duper %s
% 0.14/0.36  % Computer : n009.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 04:24:36 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 3.53/3.74  SZS status Theorem for theBenchmark.p
% 3.53/3.74  SZS output start Proof for theBenchmark.p
% 3.53/3.74  Clause #0 (by assumption #[]): Eq (Not (∀ (X Y Z : b → b), Eq (fun W => X (Y (Z W))) fun W => X (Y (Z W)))) True
% 3.53/3.74  Clause #1 (by clausification #[0]): Eq (∀ (X Y Z : b → b), Eq (fun W => X (Y (Z W))) fun W => X (Y (Z W))) False
% 3.53/3.74  Clause #2 (by clausification #[1]): ∀ (a : b → b), Eq (Not (∀ (Y Z : b → b), Eq (fun W => skS.0 0 a (Y (Z W))) fun W => skS.0 0 a (Y (Z W)))) True
% 3.53/3.74  Clause #3 (by clausification #[2]): ∀ (a : b → b), Eq (∀ (Y Z : b → b), Eq (fun W => skS.0 0 a (Y (Z W))) fun W => skS.0 0 a (Y (Z W))) False
% 3.53/3.74  Clause #4 (by clausification #[3]): ∀ (a a_1 : b → b),
% 3.53/3.74    Eq (Not (∀ (Z : b → b), Eq (fun W => skS.0 0 a (skS.0 1 a a_1 (Z W))) fun W => skS.0 0 a (skS.0 1 a a_1 (Z W)))) True
% 3.53/3.74  Clause #5 (by clausification #[4]): ∀ (a a_1 : b → b),
% 3.53/3.74    Eq (∀ (Z : b → b), Eq (fun W => skS.0 0 a (skS.0 1 a a_1 (Z W))) fun W => skS.0 0 a (skS.0 1 a a_1 (Z W))) False
% 3.53/3.74  Clause #6 (by clausification #[5]): ∀ (a a_1 a_2 : b → b),
% 3.53/3.74    Eq
% 3.53/3.74      (Not
% 3.53/3.74        (Eq (fun W => skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))) fun W =>
% 3.53/3.74          skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))))
% 3.53/3.74      True
% 3.53/3.74  Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : b → b),
% 3.53/3.74    Eq
% 3.53/3.74      (Eq (fun W => skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))) fun W =>
% 3.53/3.74        skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W)))
% 3.53/3.74      False
% 3.53/3.74  Clause #8 (by clausification #[7]): ∀ (a a_1 a_2 : b → b),
% 3.53/3.74    Ne (fun W => skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))) fun W => skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))
% 3.53/3.74  Clause #9 (by eliminate resolved literals #[8]): False
% 3.53/3.74  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------