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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEU163+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n021.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:40:33 EDT 2023

% Result   : Theorem 3.64s 3.80s
% Output   : Proof 3.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SEU163+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n021.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   : Wed Aug 23 13:32:09 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.64/3.80  SZS status Theorem for theBenchmark.p
% 3.64/3.80  SZS output start Proof for theBenchmark.p
% 3.64/3.80  Clause #3 (by assumption #[]): Eq (Not (∀ (A B : Iota), in A B → subset A (union B))) True
% 3.64/3.80  Clause #4 (by assumption #[]): Eq (∀ (A B : Iota), in A B → subset A (union B)) True
% 3.64/3.80  Clause #11 (by clausification #[4]): ∀ (a : Iota), Eq (∀ (B : Iota), in a B → subset a (union B)) True
% 3.64/3.80  Clause #12 (by clausification #[11]): ∀ (a a_1 : Iota), Eq (in a a_1 → subset a (union a_1)) True
% 3.64/3.80  Clause #13 (by clausification #[12]): ∀ (a a_1 : Iota), Or (Eq (in a a_1) False) (Eq (subset a (union a_1)) True)
% 3.64/3.80  Clause #14 (by clausification #[3]): Eq (∀ (A B : Iota), in A B → subset A (union B)) False
% 3.64/3.80  Clause #15 (by clausification #[14]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), in (skS.0 0 a) B → subset (skS.0 0 a) (union B))) True
% 3.64/3.80  Clause #16 (by clausification #[15]): ∀ (a : Iota), Eq (∀ (B : Iota), in (skS.0 0 a) B → subset (skS.0 0 a) (union B)) False
% 3.64/3.80  Clause #17 (by clausification #[16]): ∀ (a a_1 : Iota), Eq (Not (in (skS.0 0 a) (skS.0 1 a a_1) → subset (skS.0 0 a) (union (skS.0 1 a a_1)))) True
% 3.64/3.80  Clause #18 (by clausification #[17]): ∀ (a a_1 : Iota), Eq (in (skS.0 0 a) (skS.0 1 a a_1) → subset (skS.0 0 a) (union (skS.0 1 a a_1))) False
% 3.64/3.80  Clause #19 (by clausification #[18]): ∀ (a a_1 : Iota), Eq (in (skS.0 0 a) (skS.0 1 a a_1)) True
% 3.64/3.80  Clause #20 (by clausification #[18]): ∀ (a a_1 : Iota), Eq (subset (skS.0 0 a) (union (skS.0 1 a a_1))) False
% 3.64/3.80  Clause #22 (by superposition #[19, 13]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (subset (skS.0 0 a) (union (skS.0 1 a a_1))) True)
% 3.64/3.80  Clause #24 (by clausification #[22]): ∀ (a a_1 : Iota), Eq (subset (skS.0 0 a) (union (skS.0 1 a a_1))) True
% 3.64/3.80  Clause #25 (by superposition #[24, 20]): Eq True False
% 3.64/3.80  Clause #26 (by clausification #[25]): False
% 3.64/3.80  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------