TSTP Solution File: SYN941+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SYN941+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 : 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:47:24 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.07/0.12 % Problem : SYN941+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.14/0.33 % Computer : n025.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 12 06:05:03 EDT 2022
% 0.14/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. (-. (p (f T_0))) (p (f T_0)) ### Axiom
% 0.20/0.41 2. (-. ((p (f T_0)) => ((p (f T_0)) /\ ((r T_0) => ((r T_0) /\ (r T_1)))))) (-. (p (f T_0))) ### NotImply 1
% 0.20/0.41 3. (q (f T_0)) (-. (q (f T_0))) ### Axiom
% 0.20/0.41 4. (-. (((p (f T_0)) => ((p (f T_0)) /\ ((r T_0) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0)))) (q (f T_0)) (-. (p (f T_0))) ### NotAnd 2 3
% 0.20/0.41 5. (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) (-. (p (f T_0))) (q (f T_0)) ### NotExists 4
% 0.20/0.41 6. (p (f T_0)) (-. (p (f T_0))) ### Axiom
% 0.20/0.41 7. (-. (r T_0)) (r T_0) ### Axiom
% 0.20/0.41 8. (-. ((r T_0) => ((r T_0) /\ (r T_1)))) (-. (r T_0)) ### NotImply 7
% 0.20/0.41 9. (-. ((p (f T_0)) /\ ((r T_0) => ((r T_0) /\ (r T_1))))) (-. (r T_0)) (p (f T_0)) ### NotAnd 6 8
% 0.20/0.41 10. (-. ((p (f T_0)) => ((p (f T_0)) /\ ((r T_0) => ((r T_0) /\ (r T_1)))))) (-. (r T_0)) ### NotImply 9
% 0.20/0.41 11. (q (f T_0)) (-. (q (f T_0))) ### Axiom
% 0.20/0.41 12. (-. (((p (f T_0)) => ((p (f T_0)) /\ ((r T_0) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0)))) (q (f T_0)) (-. (r T_0)) ### NotAnd 10 11
% 0.20/0.41 13. (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) (-. (r T_0)) (q (f T_0)) ### NotExists 12
% 0.20/0.41 14. (-. (r T_1)) (r T_1) ### Axiom
% 0.20/0.41 15. (-. ((r T_1) => ((r T_0) /\ (r T_1)))) (-. (r T_1)) ### NotImply 14
% 0.20/0.41 16. (-. ((p (f T_0)) /\ ((r T_1) => ((r T_0) /\ (r T_1))))) (-. (r T_1)) (q (f T_0)) (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) ### NotAnd 5 15
% 0.20/0.41 17. (-. ((p (f T_1)) => ((p (f T_0)) /\ ((r T_1) => ((r T_0) /\ (r T_1)))))) (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) (q (f T_0)) (-. (r T_1)) ### NotImply 16
% 0.20/0.41 18. (q (f T_0)) (-. (q (f T_0))) ### Axiom
% 0.20/0.41 19. (-. (((p (f T_1)) => ((p (f T_0)) /\ ((r T_1) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0)))) (-. (r T_1)) (q (f T_0)) (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) ### NotAnd 17 18
% 0.20/0.41 20. (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) (q (f T_0)) (-. (r T_1)) ### NotExists 19
% 0.20/0.41 21. (-. ((r T_0) /\ (r T_1))) (q (f T_0)) (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) ### NotAnd 13 20
% 0.20/0.41 22. (-. ((r zenon_X2) => ((r T_0) /\ (r T_1)))) (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) (q (f T_0)) ### NotImply 21
% 0.20/0.41 23. (-. ((p (f T_0)) /\ ((r zenon_X2) => ((r T_0) /\ (r T_1))))) (q (f T_0)) (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) ### NotAnd 5 22
% 0.20/0.41 24. (-. ((p (f zenon_X2)) => ((p (f T_0)) /\ ((r zenon_X2) => ((r T_0) /\ (r T_1)))))) (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) (q (f T_0)) ### NotImply 23
% 0.20/0.41 25. (q (f T_0)) (-. (q (f T_0))) ### Axiom
% 0.20/0.41 26. (-. (((p (f zenon_X2)) => ((p (f T_0)) /\ ((r zenon_X2) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0)))) (q (f T_0)) (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) ### NotAnd 24 25
% 0.20/0.41 27. (-. (Ex Y, (((p (f Y)) => ((p (f T_0)) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q (f T_0))))) (q (f T_0)) ### NotExists 26
% 0.20/0.41 28. (-. (Ex X, (Ex Y, (((p (f Y)) => ((p X) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q X))))) (q (f T_0)) ### NotExists 27
% 0.20/0.41 29. (-. ((q (f T_0)) => (Ex X, (Ex Y, (((p (f Y)) => ((p X) /\ ((r Y) => ((r T_0) /\ (r T_1))))) /\ (q X)))))) ### NotImply 28
% 0.20/0.41 30. (-. (All C, ((q (f T_0)) => (Ex X, (Ex Y, (((p (f Y)) => ((p X) /\ ((r Y) => ((r T_0) /\ (r C))))) /\ (q X))))))) ### NotAllEx 29
% 0.20/0.41 31. (-. (All B, (All C, ((q (f B)) => (Ex X, (Ex Y, (((p (f Y)) => ((p X) /\ ((r Y) => ((r B) /\ (r C))))) /\ (q X)))))))) ### NotAllEx 30
% 0.20/0.41 % SZS output end Proof
% 0.20/0.41 (* END-PROOF *)
%------------------------------------------------------------------------------