TSTP Solution File: SYN417+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SYN417+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 : n025.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:27 EDT 2022
% Result : Theorem 0.20s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN417+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33 % Computer : n025.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 02:50:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 (* PROOF-FOUND *)
% 0.20/0.41 (* BEGIN-PROOF *)
% 0.20/0.41 % SZS output start Proof
% 0.20/0.41 1. (T_0 = (g (f T_0))) (T_0 != (g (f T_0))) ### Axiom
% 0.20/0.41 2. ((f T_0) != (f (g (f T_0)))) (T_0 = (g (f T_0))) ### NotEqual 1
% 0.20/0.41 3. (T_1 != T_1) ### Refl(=)
% 0.20/0.41 4. (T_1 != T_1) ### Refl(=)
% 0.20/0.41 5. (T_1 = (f (g T_1))) (T_1 != (f (g T_1))) ### Axiom
% 0.20/0.41 6. ((g T_1) != (g (f (g T_1)))) (T_1 = (f (g T_1))) ### NotEqual 5
% 0.20/0.41 7. ((g T_1) != T_0) (T_0 = (g T_1)) ### Sym(=)
% 0.20/0.41 8. (((g T_1) = (g (f (g T_1)))) => (T_0 = (g T_1))) ((g T_1) != T_0) (T_1 = (f (g T_1))) ### Imply 6 7
% 0.20/0.41 9. (All Y, ((Y = (g (f Y))) => (T_0 = Y))) (T_1 = (f (g T_1))) ((g T_1) != T_0) ### All 8
% 0.20/0.41 10. ((f (g T_1)) != (f T_0)) (T_1 = (f (g T_1))) (All Y, ((Y = (g (f Y))) => (T_0 = Y))) ### NotEqual 9
% 0.20/0.41 11. ((f T_0) != T_1) (All Y, ((Y = (g (f Y))) => (T_0 = Y))) (T_1 = (f (g T_1))) ### TransEq-sym 3 4 10
% 0.20/0.41 12. (-. ((T_1 = (f (g T_1))) => ((f T_0) = T_1))) (All Y, ((Y = (g (f Y))) => (T_0 = Y))) ### NotImply 11
% 0.20/0.41 13. (-. (All Y, ((Y = (f (g Y))) => ((f T_0) = Y)))) (All Y, ((Y = (g (f Y))) => (T_0 = Y))) ### NotAllEx 12
% 0.20/0.41 14. (-. (((f T_0) = (f (g (f T_0)))) /\ (All Y, ((Y = (f (g Y))) => ((f T_0) = Y))))) (All Y, ((Y = (g (f Y))) => (T_0 = Y))) (T_0 = (g (f T_0))) ### NotAnd 2 13
% 0.20/0.41 15. (-. (Ex X, ((X = (f (g X))) /\ (All Y, ((Y = (f (g Y))) => (X = Y)))))) (T_0 = (g (f T_0))) (All Y, ((Y = (g (f Y))) => (T_0 = Y))) ### NotExists 14
% 0.20/0.41 16. ((T_0 = (g (f T_0))) /\ (All Y, ((Y = (g (f Y))) => (T_0 = Y)))) (-. (Ex X, ((X = (f (g X))) /\ (All Y, ((Y = (f (g Y))) => (X = Y)))))) ### And 15
% 0.20/0.41 17. (Ex X, ((X = (g (f X))) /\ (All Y, ((Y = (g (f Y))) => (X = Y))))) (-. (Ex X, ((X = (f (g X))) /\ (All Y, ((Y = (f (g Y))) => (X = Y)))))) ### Exists 16
% 0.20/0.41 18. (T_2 = (f (g T_2))) (T_2 != (f (g T_2))) ### Axiom
% 0.20/0.41 19. ((g T_2) != (g (f (g T_2)))) (T_2 = (f (g T_2))) ### NotEqual 18
% 0.20/0.41 20. (T_3 != T_3) ### Refl(=)
% 0.20/0.41 21. (T_3 != T_3) ### Refl(=)
% 0.20/0.41 22. (T_3 = (g (f T_3))) (T_3 != (g (f T_3))) ### Axiom
% 0.20/0.41 23. ((f T_3) != (f (g (f T_3)))) (T_3 = (g (f T_3))) ### NotEqual 22
% 0.20/0.41 24. ((f T_3) != T_2) (T_2 = (f T_3)) ### Sym(=)
% 0.20/0.41 25. (((f T_3) = (f (g (f T_3)))) => (T_2 = (f T_3))) ((f T_3) != T_2) (T_3 = (g (f T_3))) ### Imply 23 24
% 0.20/0.41 26. (All Y, ((Y = (f (g Y))) => (T_2 = Y))) (T_3 = (g (f T_3))) ((f T_3) != T_2) ### All 25
% 0.20/0.41 27. ((g (f T_3)) != (g T_2)) (T_3 = (g (f T_3))) (All Y, ((Y = (f (g Y))) => (T_2 = Y))) ### NotEqual 26
% 0.20/0.41 28. ((g T_2) != T_3) (All Y, ((Y = (f (g Y))) => (T_2 = Y))) (T_3 = (g (f T_3))) ### TransEq-sym 20 21 27
% 0.20/0.41 29. (-. ((T_3 = (g (f T_3))) => ((g T_2) = T_3))) (All Y, ((Y = (f (g Y))) => (T_2 = Y))) ### NotImply 28
% 0.20/0.41 30. (-. (All Y, ((Y = (g (f Y))) => ((g T_2) = Y)))) (All Y, ((Y = (f (g Y))) => (T_2 = Y))) ### NotAllEx 29
% 0.20/0.41 31. (-. (((g T_2) = (g (f (g T_2)))) /\ (All Y, ((Y = (g (f Y))) => ((g T_2) = Y))))) (All Y, ((Y = (f (g Y))) => (T_2 = Y))) (T_2 = (f (g T_2))) ### NotAnd 19 30
% 0.20/0.41 32. (-. (Ex X, ((X = (g (f X))) /\ (All Y, ((Y = (g (f Y))) => (X = Y)))))) (T_2 = (f (g T_2))) (All Y, ((Y = (f (g Y))) => (T_2 = Y))) ### NotExists 31
% 0.20/0.41 33. ((T_2 = (f (g T_2))) /\ (All Y, ((Y = (f (g Y))) => (T_2 = Y)))) (-. (Ex X, ((X = (g (f X))) /\ (All Y, ((Y = (g (f Y))) => (X = Y)))))) ### And 32
% 0.20/0.41 34. (Ex X, ((X = (f (g X))) /\ (All Y, ((Y = (f (g Y))) => (X = Y))))) (-. (Ex X, ((X = (g (f X))) /\ (All Y, ((Y = (g (f Y))) => (X = Y)))))) ### Exists 33
% 0.20/0.41 35. (-. ((Ex X, ((X = (f (g X))) /\ (All Y, ((Y = (f (g Y))) => (X = Y))))) <=> (Ex X, ((X = (g (f X))) /\ (All Y, ((Y = (g (f Y))) => (X = Y))))))) ### NotEquiv 17 34
% 0.20/0.41 % SZS output end Proof
% 0.20/0.41 (* END-PROOF *)
%------------------------------------------------------------------------------