%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SEU143+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 : n027.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:37 EDT 2022

% Result   : Theorem 0.18s 0.40s
% Output   : Proof 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 20 09:47:40 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.40  % SZS status Theorem
% 0.18/0.40  (* PROOF-FOUND *)
% 0.18/0.40  (* BEGIN-PROOF *)
% 0.18/0.40  % SZS output start Proof
% 0.18/0.40  1. ((empty_set) != (empty_set))   ### NotEqual
% 0.18/0.40  2. ((singleton T_0) = (empty_set)) ((empty_set) != (singleton T_0))   ### Sym(=)
% 0.18/0.40  3. (T_0 != T_0)   ### Refl(=)
% 0.18/0.40  4. (in T_0 (empty_set)) (-. (in T_0 (empty_set)))   ### Axiom
% 0.18/0.40  5. (All B, (-. (in B (empty_set)))) (in T_0 (empty_set))   ### All 4
% 0.18/0.40  6. ((in T_0 (empty_set)) <=> (T_0 = T_0)) (All B, (-. (in B (empty_set))))   ### Equiv 3 5
% 0.18/0.40  7. (All C, ((in C (empty_set)) <=> (C = T_0))) (All B, (-. (in B (empty_set))))   ### All 6
% 0.18/0.40  8. (((empty_set) = (singleton T_0)) <=> (All C, ((in C (empty_set)) <=> (C = T_0)))) (All B, (-. (in B (empty_set)))) ((singleton T_0) = (empty_set))   ### Equiv 2 7
% 0.18/0.40  9. (All B, ((B = (singleton T_0)) <=> (All C, ((in C B) <=> (C = T_0))))) ((singleton T_0) = (empty_set)) (All B, (-. (in B (empty_set))))   ### All 8
% 0.18/0.40  10. (All A, (All B, ((B = (singleton A)) <=> (All C, ((in C B) <=> (C = A)))))) (All B, (-. (in B (empty_set)))) ((singleton T_0) = (empty_set))   ### All 9
% 0.18/0.40  11. (((empty_set) = (empty_set)) <=> (All B, (-. (in B (empty_set))))) ((singleton T_0) = (empty_set)) (All A, (All B, ((B = (singleton A)) <=> (All C, ((in C B) <=> (C = A))))))   ### Equiv 1 10
% 0.18/0.40  12. (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) (All A, (All B, ((B = (singleton A)) <=> (All C, ((in C B) <=> (C = A)))))) ((singleton T_0) = (empty_set))   ### All 11
% 0.18/0.40  13. (-. ((singleton T_0) != (empty_set))) (All A, (All B, ((B = (singleton A)) <=> (All C, ((in C B) <=> (C = A)))))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A)))))   ### NotNot 12
% 0.18/0.40  14. (-. (All A, ((singleton A) != (empty_set)))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) (All A, (All B, ((B = (singleton A)) <=> (All C, ((in C B) <=> (C = A))))))   ### NotAllEx 13
% 0.18/0.40  % SZS output end Proof
% 0.18/0.40  (* END-PROOF *)
%------------------------------------------------------------------------------