TSTP Solution File: SYN396+1 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYN396+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n012.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 02:11:37 EDT 2023

% Result   : Theorem 3.39s 3.55s
% Output   : Proof 3.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN396+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n012.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   : Sat Aug 26 18:37:26 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.39/3.55  SZS status Theorem for theBenchmark.p
% 3.39/3.55  SZS output start Proof for theBenchmark.p
% 3.39/3.55  Clause #0 (by assumption #[]): Eq (Not (Iff (Not (∀ (X : Iota), f X)) (Exists fun Y => Not (f Y)))) True
% 3.39/3.55  Clause #1 (by clausification #[0]): Eq (Iff (Not (∀ (X : Iota), f X)) (Exists fun Y => Not (f Y))) False
% 3.39/3.55  Clause #2 (by clausification #[1]): Or (Eq (Not (∀ (X : Iota), f X)) False) (Eq (Exists fun Y => Not (f Y)) False)
% 3.39/3.55  Clause #3 (by clausification #[1]): Or (Eq (Not (∀ (X : Iota), f X)) True) (Eq (Exists fun Y => Not (f Y)) True)
% 3.39/3.55  Clause #4 (by clausification #[2]): Or (Eq (Exists fun Y => Not (f Y)) False) (Eq (∀ (X : Iota), f X) True)
% 3.39/3.55  Clause #5 (by clausification #[4]): ∀ (a : Iota), Or (Eq (∀ (X : Iota), f X) True) (Eq (Not (f a)) False)
% 3.39/3.55  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (Not (f a)) False) (Eq (f a_1) True)
% 3.39/3.55  Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq (f a) True) (Eq (f a_1) True)
% 3.39/3.55  Clause #8 (by equality factoring #[7]): ∀ (a : Iota), Or (Ne True True) (Eq (f a) True)
% 3.39/3.55  Clause #9 (by clausification #[8]): ∀ (a : Iota), Or (Eq (f a) True) (Or (Eq True False) (Eq True False))
% 3.39/3.55  Clause #11 (by clausification #[9]): ∀ (a : Iota), Or (Eq (f a) True) (Eq True False)
% 3.39/3.55  Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (f a) True
% 3.39/3.55  Clause #13 (by clausification #[3]): Or (Eq (Exists fun Y => Not (f Y)) True) (Eq (∀ (X : Iota), f X) False)
% 3.39/3.55  Clause #14 (by clausification #[13]): ∀ (a : Iota), Or (Eq (∀ (X : Iota), f X) False) (Eq (Not (f (skS.0 0 a))) True)
% 3.39/3.55  Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Or (Eq (Not (f (skS.0 0 a))) True) (Eq (Not (f (skS.0 1 a_1))) True)
% 3.39/3.55  Clause #16 (by clausification #[15]): ∀ (a a_1 : Iota), Or (Eq (Not (f (skS.0 1 a))) True) (Eq (f (skS.0 0 a_1)) False)
% 3.39/3.55  Clause #17 (by clausification #[16]): ∀ (a a_1 : Iota), Or (Eq (f (skS.0 0 a)) False) (Eq (f (skS.0 1 a_1)) False)
% 3.39/3.55  Clause #18 (by superposition #[17, 12]): ∀ (a : Iota), Or (Eq (f (skS.0 1 a)) False) (Eq False True)
% 3.39/3.55  Clause #19 (by clausification #[18]): ∀ (a : Iota), Eq (f (skS.0 1 a)) False
% 3.39/3.55  Clause #20 (by superposition #[19, 12]): Eq False True
% 3.39/3.55  Clause #21 (by clausification #[20]): False
% 3.39/3.55  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------