TSTP Solution File: SYN980+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% Computer : n022.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:47:39 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33 % Computer : n022.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 13:55:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 (* PROOF-FOUND *)
% 0.12/0.40 (* BEGIN-PROOF *)
% 0.12/0.40 % SZS output start Proof
% 0.12/0.40 1. (r T_0) (-. (r T_0)) ### Axiom
% 0.12/0.40 2. (-. ((r T_0) => (r T_0))) (r T_0) ### NotImply 1
% 0.12/0.40 3. (p (f T_0) T_0) (-. (p (f T_0) T_0)) ### Axiom
% 0.12/0.40 4. (-. (q (f T_0) T_0)) (q (f T_0) T_0) ### Axiom
% 0.12/0.40 5. (-. ((q (f T_0) T_0) => (q (f T_0) T_0))) ### NotImply 4
% 0.12/0.40 6. (-. ((p (f T_0) T_0) /\ ((q (f T_0) T_0) => (q (f T_0) T_0)))) (p (f T_0) T_0) ### NotAnd 3 5
% 0.12/0.40 7. (-. (Ex Y, ((p (f T_0) Y) /\ ((q (f T_0) T_0) => (q (f T_0) Y))))) (p (f T_0) T_0) ### NotExists 6
% 0.12/0.40 8. (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) (p (f T_0) T_0) ### NotExists 7
% 0.12/0.40 9. (((r T_0) => (r T_0)) => (p (f T_0) T_0)) (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) (r T_0) ### Imply 2 8
% 0.12/0.40 10. (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) (r T_0) (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) ### All 9
% 0.12/0.40 11. (-. ((r T_0) => (r zenon_X1))) (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) ### NotImply 10
% 0.12/0.40 12. (p (f zenon_X1) zenon_X1) (-. (p (f zenon_X1) zenon_X1)) ### Axiom
% 0.12/0.40 13. (-. (r T_0)) (r T_0) ### Axiom
% 0.12/0.40 14. (-. ((r T_0) => (r T_0))) ### NotImply 13
% 0.12/0.40 15. (-. (p (f T_0) T_0)) (p (f T_0) T_0) ### Axiom
% 0.12/0.40 16. (((r T_0) => (r T_0)) => (p (f T_0) T_0)) (-. (p (f T_0) T_0)) ### Imply 14 15
% 0.12/0.40 17. (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) (-. (p (f T_0) T_0)) ### All 16
% 0.12/0.40 18. (q (f T_0) T_0) (-. (q (f T_0) T_0)) ### Axiom
% 0.12/0.40 19. (-. ((q (f T_0) T_0) => (q (f T_0) T_0))) (q (f T_0) T_0) ### NotImply 18
% 0.12/0.40 20. (-. ((p (f T_0) T_0) /\ ((q (f T_0) T_0) => (q (f T_0) T_0)))) (q (f T_0) T_0) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) ### NotAnd 17 19
% 0.12/0.40 21. (-. (Ex Y, ((p (f T_0) Y) /\ ((q (f T_0) T_0) => (q (f T_0) Y))))) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) (q (f T_0) T_0) ### NotExists 20
% 0.12/0.40 22. (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) (q (f T_0) T_0) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) ### NotExists 21
% 0.12/0.40 23. (-. ((q (f T_0) T_0) => (q (f zenon_X1) zenon_X1))) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) ### NotImply 22
% 0.12/0.40 24. (-. ((p (f zenon_X1) zenon_X1) /\ ((q (f T_0) T_0) => (q (f zenon_X1) zenon_X1)))) (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) (p (f zenon_X1) zenon_X1) ### NotAnd 12 23
% 0.12/0.40 25. (-. (Ex Y, ((p (f zenon_X1) Y) /\ ((q (f T_0) T_0) => (q (f zenon_X1) Y))))) (p (f zenon_X1) zenon_X1) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) ### NotExists 24
% 0.12/0.40 26. (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) (p (f zenon_X1) zenon_X1) ### NotExists 25
% 0.12/0.40 27. (((r T_0) => (r zenon_X1)) => (p (f zenon_X1) zenon_X1)) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) ### Imply 11 26
% 0.12/0.40 28. (-. (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y)))))) (All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) ### All 27
% 0.12/0.40 29. (-. ((All Y, (((r T_0) => (r Y)) => (p (f Y) Y))) => (Ex X, (Ex Y, ((p X Y) /\ ((q (f T_0) T_0) => (q X Y))))))) ### NotImply 28
% 0.12/0.40 30. (-. (All B, ((All Y, (((r B) => (r Y)) => (p (f Y) Y))) => (Ex X, (Ex Y, ((p X Y) /\ ((q (f B) B) => (q X Y)))))))) ### NotAllEx 29
% 0.12/0.40 % SZS output end Proof
% 0.12/0.40 (* END-PROOF *)
%------------------------------------------------------------------------------