TSTP Solution File: SEU130+1 by SuperZenon---0.0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_super_zenon -p0 -itptp -om -max-time %d %s

% Computer : n020.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  : 600s
% DateTime : Tue Jul 19 14:48:30 EDT 2022

% Result   : Theorem 9.15s 9.32s
% Output   : Proof 9.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.11/0.32  % Computer : n020.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jun 20 03:34:03 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 9.15/9.32  % SZS status Theorem
% 9.15/9.32  (* PROOF-FOUND *)
% 9.15/9.32  (* BEGIN-PROOF *)
% 9.15/9.32  % SZS output start Proof
% 9.15/9.32  1. (-. (in T_0 T_1)) (in T_0 T_1)   ### Axiom
% 9.15/9.32  2. ((in T_0 T_1) /\ (in T_0 T_2)) (-. (in T_0 T_1))   ### And 1
% 9.15/9.32  3. (in T_0 T_1) (-. (in T_0 T_1))   ### Axiom
% 9.15/9.32  4. (in T_0 T_1) (-. (in T_0 T_1))   ### Axiom
% 9.15/9.32  5. (-. (in T_0 T_2)) (in T_0 T_2)   ### Axiom
% 9.15/9.32  6. ((in T_0 T_1) => (in T_0 T_2)) (-. (in T_0 T_2)) (in T_0 T_1)   ### Imply 4 5
% 9.15/9.32  7. (All C, ((in C T_1) => (in C T_2))) (in T_0 T_1) (-. (in T_0 T_2))   ### All 6
% 9.15/9.32  8. (-. ((in T_0 T_1) /\ (in T_0 T_2))) (All C, ((in C T_1) => (in C T_2))) (in T_0 T_1)   ### NotAnd 3 7
% 9.15/9.32  9. (-. ((in T_0 T_1) <=> ((in T_0 T_1) /\ (in T_0 T_2)))) (All C, ((in C T_1) => (in C T_2)))   ### NotEquiv 2 8
% 9.15/9.32  10. (-. (All D, ((in D T_1) <=> ((in D T_1) /\ (in D T_2))))) (All C, ((in C T_1) => (in C T_2)))   ### NotAllEx 9
% 9.15/9.32  11. ((set_intersection2 T_1 T_2) != T_1) (T_1 = (set_intersection2 T_1 T_2))   ### Sym(=)
% 9.15/9.32  12. ((T_1 = (set_intersection2 T_1 T_2)) <=> (All D, ((in D T_1) <=> ((in D T_1) /\ (in D T_2))))) ((set_intersection2 T_1 T_2) != T_1) (All C, ((in C T_1) => (in C T_2)))   ### Equiv 10 11
% 9.15/9.32  13. (All C, ((C = (set_intersection2 T_1 T_2)) <=> (All D, ((in D C) <=> ((in D T_1) /\ (in D T_2)))))) (All C, ((in C T_1) => (in C T_2))) ((set_intersection2 T_1 T_2) != T_1)   ### All 12
% 9.15/9.32  14. (All B, (All C, ((C = (set_intersection2 T_1 B)) <=> (All D, ((in D C) <=> ((in D T_1) /\ (in D B))))))) ((set_intersection2 T_1 T_2) != T_1) (All C, ((in C T_1) => (in C T_2)))   ### All 13
% 9.15/9.32  15. (All A, (All B, (All C, ((C = (set_intersection2 A B)) <=> (All D, ((in D C) <=> ((in D A) /\ (in D B)))))))) (All C, ((in C T_1) => (in C T_2))) ((set_intersection2 T_1 T_2) != T_1)   ### All 14
% 9.15/9.32  16. (subset T_1 T_2) ((set_intersection2 T_1 T_2) != T_1) (All A, (All B, (All C, ((C = (set_intersection2 A B)) <=> (All D, ((in D C) <=> ((in D A) /\ (in D B))))))))   ### Definition-Pseudo(subset) 15
% 9.15/9.32  17. (-. ((subset T_1 T_2) => ((set_intersection2 T_1 T_2) = T_1))) (All A, (All B, (All C, ((C = (set_intersection2 A B)) <=> (All D, ((in D C) <=> ((in D A) /\ (in D B))))))))   ### NotImply 16
% 9.15/9.32  18. (-. (All B, ((subset T_1 B) => ((set_intersection2 T_1 B) = T_1)))) (All A, (All B, (All C, ((C = (set_intersection2 A B)) <=> (All D, ((in D C) <=> ((in D A) /\ (in D B))))))))   ### NotAllEx 17
% 9.15/9.32  19. (-. (All A, (All B, ((subset A B) => ((set_intersection2 A B) = A))))) (All A, (All B, (All C, ((C = (set_intersection2 A B)) <=> (All D, ((in D C) <=> ((in D A) /\ (in D B))))))))   ### NotAllEx 18
% 9.15/9.32  % SZS output end Proof
% 9.15/9.32  (* END-PROOF *)
%------------------------------------------------------------------------------