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

View Problem - Process Solution

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

% Computer : n013.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.34s 3.72s
% Output   : Proof 3.34s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO215^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n013.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sat Aug 26 02:20:47 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 3.34/3.72  SZS status Theorem for theBenchmark.p
% 3.34/3.72  SZS output start Proof for theBenchmark.p
% 3.34/3.72  Clause #0 (by assumption #[]): Eq (Not ((Exists fun X => Exists fun Y => Ne X Y) → ∀ (U : Iota), Exists fun Z => Ne Z U)) True
% 3.34/3.72  Clause #1 (by betaEtaReduce #[0]): Eq (Not ((Exists fun X => Exists (Ne X)) → ∀ (U : Iota), Exists fun Z => Ne Z U)) True
% 3.34/3.72  Clause #2 (by clausification #[1]): Eq ((Exists fun X => Exists (Ne X)) → ∀ (U : Iota), Exists fun Z => Ne Z U) False
% 3.34/3.72  Clause #3 (by clausification #[2]): Eq (Exists fun X => Exists (Ne X)) True
% 3.34/3.72  Clause #4 (by clausification #[2]): Eq (∀ (U : Iota), Exists fun Z => Ne Z U) False
% 3.34/3.72  Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (Exists (Ne (skS.0 0 a))) True
% 3.34/3.72  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Ne (skS.0 0 a) (skS.0 1 a a_1)) True
% 3.34/3.72  Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Ne (skS.0 0 a) (skS.0 1 a a_1)
% 3.34/3.72  Clause #8 (by clausification #[4]): ∀ (a : Iota), Eq (Not (Exists fun Z => Ne Z (skS.0 2 a))) True
% 3.34/3.72  Clause #9 (by clausification #[8]): ∀ (a : Iota), Eq (Exists fun Z => Ne Z (skS.0 2 a)) False
% 3.34/3.72  Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Eq (Ne a (skS.0 2 a_1)) False
% 3.34/3.72  Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Eq a (skS.0 2 a_1)
% 3.34/3.72  Clause #13 (by superposition #[11, 11]): ∀ (a a_1 : Iota), Eq a a_1
% 3.34/3.72  Clause #14 (by backward contextual literal cutting #[13, 7]): False
% 3.34/3.72  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------