TSTP Solution File: SYN059+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SYN059+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 : n017.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:40:42 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN059+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 : n017.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 Jul 11 23:51:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.39 % SZS status Theorem
% 0.20/0.39 (* PROOF-FOUND *)
% 0.20/0.39 (* BEGIN-PROOF *)
% 0.20/0.39 % SZS output start Proof
% 0.20/0.39 1. (big_f T_0) (-. (big_f T_0)) ### Axiom
% 0.20/0.39 2. (big_g T_1) (-. (big_g T_1)) ### Axiom
% 0.20/0.39 3. (-. (big_h T_0)) (big_h T_0) ### Axiom
% 0.20/0.39 4. ((big_h T_0) /\ (big_j T_1)) (-. (big_h T_0)) ### And 3
% 0.20/0.39 5. (((big_f T_0) /\ (big_g T_1)) => ((big_h T_0) /\ (big_j T_1))) (-. (big_h T_0)) (big_g T_1) (big_f T_0) ### DisjTree 1 2 4
% 0.20/0.39 6. (All Y, (((big_f T_0) /\ (big_g Y)) => ((big_h T_0) /\ (big_j Y)))) (big_f T_0) (big_g T_1) (-. (big_h T_0)) ### All 5
% 0.20/0.39 7. (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))) (-. (big_h T_0)) (big_g T_1) (big_f T_0) ### All 6
% 0.20/0.39 8. (-. ((big_f T_0) => (big_h T_0))) (big_g T_1) (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))) ### NotImply 7
% 0.20/0.39 9. (-. (All X, ((big_f X) => (big_h X)))) (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))) (big_g T_1) ### NotAllEx 8
% 0.20/0.39 10. (big_f T_2) (-. (big_f T_2)) ### Axiom
% 0.20/0.39 11. (big_g T_3) (-. (big_g T_3)) ### Axiom
% 0.20/0.39 12. (-. (big_j T_3)) (big_j T_3) ### Axiom
% 0.20/0.39 13. ((big_h T_2) /\ (big_j T_3)) (-. (big_j T_3)) ### And 12
% 0.20/0.39 14. (((big_f T_2) /\ (big_g T_3)) => ((big_h T_2) /\ (big_j T_3))) (-. (big_j T_3)) (big_g T_3) (big_f T_2) ### DisjTree 10 11 13
% 0.20/0.39 15. (All Y, (((big_f T_2) /\ (big_g Y)) => ((big_h T_2) /\ (big_j Y)))) (big_f T_2) (big_g T_3) (-. (big_j T_3)) ### All 14
% 0.20/0.39 16. (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))) (-. (big_j T_3)) (big_g T_3) (big_f T_2) ### All 15
% 0.20/0.39 17. (-. ((big_g T_3) => (big_j T_3))) (big_f T_2) (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))) ### NotImply 16
% 0.20/0.39 18. (-. (All U, ((big_g U) => (big_j U)))) (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))) (big_f T_2) ### NotAllEx 17
% 0.20/0.39 19. (-. ((All X, ((big_f X) => (big_h X))) /\ (All U, ((big_g U) => (big_j U))))) (big_f T_2) (big_g T_1) (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))) ### NotAnd 9 18
% 0.20/0.39 20. (big_f T_4) (-. (big_f T_4)) ### Axiom
% 0.20/0.39 21. (-. (big_h T_4)) (big_h T_4) ### Axiom
% 0.20/0.39 22. ((big_f T_4) => (big_h T_4)) (-. (big_h T_4)) (big_f T_4) ### Imply 20 21
% 0.20/0.39 23. (All X, ((big_f X) => (big_h X))) (big_f T_4) (-. (big_h T_4)) ### All 22
% 0.20/0.39 24. (big_g T_5) (-. (big_g T_5)) ### Axiom
% 0.20/0.39 25. (-. (big_j T_5)) (big_j T_5) ### Axiom
% 0.20/0.39 26. ((big_g T_5) => (big_j T_5)) (-. (big_j T_5)) (big_g T_5) ### Imply 24 25
% 0.20/0.39 27. (All U, ((big_g U) => (big_j U))) (big_g T_5) (-. (big_j T_5)) ### All 26
% 0.20/0.39 28. (-. ((big_h T_4) /\ (big_j T_5))) (big_g T_5) (All U, ((big_g U) => (big_j U))) (big_f T_4) (All X, ((big_f X) => (big_h X))) ### NotAnd 23 27
% 0.20/0.39 29. (-. (((big_f T_4) /\ (big_g T_5)) => ((big_h T_4) /\ (big_j T_5)))) (All X, ((big_f X) => (big_h X))) (All U, ((big_g U) => (big_j U))) ### ConjTree 28
% 0.20/0.39 30. (-. (All Y, (((big_f T_4) /\ (big_g Y)) => ((big_h T_4) /\ (big_j Y))))) (All U, ((big_g U) => (big_j U))) (All X, ((big_f X) => (big_h X))) ### NotAllEx 29
% 0.20/0.39 31. (-. (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y)))))) (All X, ((big_f X) => (big_h X))) (All U, ((big_g U) => (big_j U))) ### NotAllEx 30
% 0.20/0.39 32. ((All X, ((big_f X) => (big_h X))) /\ (All U, ((big_g U) => (big_j U)))) (-. (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y)))))) ### And 31
% 0.20/0.39 33. (-. (((All X, ((big_f X) => (big_h X))) /\ (All U, ((big_g U) => (big_j U)))) <=> (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))))) (big_g T_1) (big_f T_2) ### NotEquiv 19 32
% 0.20/0.39 34. (Ex Y, (big_g Y)) (big_f T_2) (-. (((All X, ((big_f X) => (big_h X))) /\ (All U, ((big_g U) => (big_j U)))) <=> (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))))) ### Exists 33
% 0.20/0.39 35. (Ex X, (big_f X)) (-. (((All X, ((big_f X) => (big_h X))) /\ (All U, ((big_g U) => (big_j U)))) <=> (All W, (All Y, (((big_f W) /\ (big_g Y)) => ((big_h W) /\ (big_j Y))))))) (Ex Y, (big_g Y)) ### Exists 34
% 0.20/0.39 % SZS output end Proof
% 0.20/0.39 (* END-PROOF *)
%------------------------------------------------------------------------------