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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYN958+1 : TPTP v8.1.2. Released v3.1.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 02:13:26 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN958+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 18:07:50 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.36/3.53  SZS status Theorem for theBenchmark.p
% 3.36/3.53  SZS output start Proof for theBenchmark.p
% 3.36/3.53  Clause #0 (by assumption #[]): Eq (Not (And (Exists fun X => a X) (∀ (X : Iota), b X) → Exists fun X => And (a X) (b X))) True
% 3.36/3.53  Clause #1 (by betaEtaReduce #[0]): Eq (Not (And (Exists a) (∀ (X : Iota), b X) → Exists fun X => And (a X) (b X))) True
% 3.36/3.53  Clause #2 (by clausification #[1]): Eq (And (Exists a) (∀ (X : Iota), b X) → Exists fun X => And (a X) (b X)) False
% 3.36/3.53  Clause #3 (by clausification #[2]): Eq (And (Exists a) (∀ (X : Iota), b X)) True
% 3.36/3.53  Clause #4 (by clausification #[2]): Eq (Exists fun X => And (a X) (b X)) False
% 3.36/3.53  Clause #5 (by clausification #[3]): Eq (∀ (X : Iota), b X) True
% 3.36/3.53  Clause #6 (by clausification #[3]): Eq (Exists a) True
% 3.36/3.53  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (b a) True
% 3.36/3.53  Clause #8 (by clausification #[6]): ∀ (a_1 : Iota), Eq (a (skS.0 0 a_1)) True
% 3.36/3.53  Clause #9 (by clausification #[4]): ∀ (a_1 : Iota), Eq (And (a a_1) (b a_1)) False
% 3.36/3.53  Clause #10 (by clausification #[9]): ∀ (a_1 : Iota), Or (Eq (a a_1) False) (Eq (b a_1) False)
% 3.36/3.53  Clause #11 (by forward demodulation #[10, 7]): ∀ (a_1 : Iota), Or (Eq (a a_1) False) (Eq True False)
% 3.36/3.53  Clause #12 (by clausification #[11]): ∀ (a_1 : Iota), Eq (a a_1) False
% 3.36/3.53  Clause #13 (by superposition #[12, 8]): Eq False True
% 3.36/3.53  Clause #14 (by clausification #[13]): False
% 3.36/3.53  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------