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

View Problem - Process Solution

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

% Computer : n024.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 : Thu Jul 21 12:43:26 EDT 2022

% Result   : Theorem 0.19s 0.41s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN415+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.34  % Computer : n024.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul 12 04:23:58 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  (* PROOF-FOUND *)
% 0.19/0.41  (* BEGIN-PROOF *)
% 0.19/0.41  % SZS output start Proof
% 0.19/0.41  1. (f T_0) (-. (f T_0))   ### Axiom
% 0.19/0.41  2. (-. (Ex X, (f X))) (f T_0)   ### NotExists 1
% 0.19/0.41  3. (f T_1) (-. (f T_1))   ### Axiom
% 0.19/0.41  4. (f T_2) (-. (f T_2))   ### Axiom
% 0.19/0.41  5. (T_2 != T_0) (T_0 = T_2)   ### Sym(=)
% 0.19/0.41  6. ((f T_2) => (T_0 = T_2)) (T_2 != T_0) (f T_2)   ### Imply 4 5
% 0.19/0.41  7. (All V, ((f V) => (T_0 = V))) (f T_2) (T_2 != T_0)   ### All 6
% 0.19/0.41  8. (T_1 != T_1)   ### Refl(=)
% 0.19/0.41  9. (T_1 != T_1)   ### Refl(=)
% 0.19/0.41  10. (T_2 != T_1) (T_0 = T_1) (f T_2) (All V, ((f V) => (T_0 = V)))   ### TransEq 7 8 9
% 0.19/0.41  11. ((f T_1) => (T_0 = T_1)) (All V, ((f V) => (T_0 = V))) (f T_2) (T_2 != T_1) (f T_1)   ### Imply 3 10
% 0.19/0.41  12. (f T_1) (T_2 != T_1) (f T_2) (All V, ((f V) => (T_0 = V)))   ### All 11
% 0.19/0.41  13. (-. (((f T_2) /\ (f T_1)) => (T_2 = T_1))) (All V, ((f V) => (T_0 = V)))   ### ConjTree 12
% 0.19/0.41  14. (-. (All Z, (((f T_2) /\ (f Z)) => (T_2 = Z)))) (All V, ((f V) => (T_0 = V)))   ### NotAllEx 13
% 0.19/0.41  15. (-. (All Y, (All Z, (((f Y) /\ (f Z)) => (Y = Z))))) (All V, ((f V) => (T_0 = V)))   ### NotAllEx 14
% 0.19/0.41  16. (-. ((Ex X, (f X)) /\ (All Y, (All Z, (((f Y) /\ (f Z)) => (Y = Z)))))) (All V, ((f V) => (T_0 = V))) (f T_0)   ### NotAnd 2 15
% 0.19/0.41  17. ((f T_0) /\ (All V, ((f V) => (T_0 = V)))) (-. ((Ex X, (f X)) /\ (All Y, (All Z, (((f Y) /\ (f Z)) => (Y = Z))))))   ### And 16
% 0.19/0.41  18. (Ex U, ((f U) /\ (All V, ((f V) => (U = V))))) (-. ((Ex X, (f X)) /\ (All Y, (All Z, (((f Y) /\ (f Z)) => (Y = Z))))))   ### Exists 17
% 0.19/0.41  19. (f T_3) (-. (f T_3))   ### Axiom
% 0.19/0.41  20. (f T_3) (-. (f T_3))   ### Axiom
% 0.19/0.41  21. (f T_4) (-. (f T_4))   ### Axiom
% 0.19/0.41  22. (T_3 != T_4) (T_3 = T_4)   ### Axiom
% 0.19/0.41  23. (((f T_3) /\ (f T_4)) => (T_3 = T_4)) (T_3 != T_4) (f T_4) (f T_3)   ### DisjTree 20 21 22
% 0.19/0.41  24. (All Z, (((f T_3) /\ (f Z)) => (T_3 = Z))) (f T_3) (f T_4) (T_3 != T_4)   ### All 23
% 0.19/0.41  25. (-. ((f T_4) => (T_3 = T_4))) (f T_3) (All Z, (((f T_3) /\ (f Z)) => (T_3 = Z)))   ### NotImply 24
% 0.19/0.41  26. (-. (All V, ((f V) => (T_3 = V)))) (All Z, (((f T_3) /\ (f Z)) => (T_3 = Z))) (f T_3)   ### NotAllEx 25
% 0.19/0.41  27. (-. ((f T_3) /\ (All V, ((f V) => (T_3 = V))))) (All Z, (((f T_3) /\ (f Z)) => (T_3 = Z))) (f T_3)   ### NotAnd 19 26
% 0.19/0.41  28. (-. (Ex U, ((f U) /\ (All V, ((f V) => (U = V)))))) (f T_3) (All Z, (((f T_3) /\ (f Z)) => (T_3 = Z)))   ### NotExists 27
% 0.19/0.41  29. (All Y, (All Z, (((f Y) /\ (f Z)) => (Y = Z)))) (f T_3) (-. (Ex U, ((f U) /\ (All V, ((f V) => (U = V))))))   ### All 28
% 0.19/0.41  30. (Ex X, (f X)) (-. (Ex U, ((f U) /\ (All V, ((f V) => (U = V)))))) (All Y, (All Z, (((f Y) /\ (f Z)) => (Y = Z))))   ### Exists 29
% 0.19/0.41  31. ((Ex X, (f X)) /\ (All Y, (All Z, (((f Y) /\ (f Z)) => (Y = Z))))) (-. (Ex U, ((f U) /\ (All V, ((f V) => (U = V))))))   ### And 30
% 0.19/0.41  32. (-. (((Ex X, (f X)) /\ (All Y, (All Z, (((f Y) /\ (f Z)) => (Y = Z))))) <=> (Ex U, ((f U) /\ (All V, ((f V) => (U = V)))))))   ### NotEquiv 18 31
% 0.19/0.41  % SZS output end Proof
% 0.19/0.41  (* END-PROOF *)
%------------------------------------------------------------------------------