TSTP Solution File: SYN949+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SYN949+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 : n013.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: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.07/0.13 % Problem : SYN949+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.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jul 12 04:32:29 EDT 2022
% 0.14/0.35 % 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. (s T_0) (-. (s T_0)) ### Axiom
% 0.20/0.41 2. (-. (p T_0)) (p T_0) ### Axiom
% 0.20/0.41 3. ((s T_0) => (p T_0)) (-. (p T_0)) (s T_0) ### Imply 1 2
% 0.20/0.41 4. (All X, ((s X) => (p X))) (s T_0) (-. (p T_0)) ### All 3
% 0.20/0.41 5. (r T_0 T_1) (-. (r T_0 T_1)) ### Axiom
% 0.20/0.41 6. (-. (q T_0 T_1)) (q T_0 T_1) ### Axiom
% 0.20/0.41 7. ((r T_0 T_1) => (q T_0 T_1)) (-. (q T_0 T_1)) (r T_0 T_1) ### Imply 5 6
% 0.20/0.41 8. (All Y, ((r T_0 Y) => (q T_0 Y))) (r T_0 T_1) (-. (q T_0 T_1)) ### All 7
% 0.20/0.41 9. (All X, (All Y, ((r X Y) => (q X Y)))) (-. (q T_0 T_1)) (r T_0 T_1) ### All 8
% 0.20/0.41 10. (-. ((p T_0) /\ (q T_0 T_1))) (r T_0 T_1) (All X, (All Y, ((r X Y) => (q X Y)))) (s T_0) (All X, ((s X) => (p X))) ### NotAnd 4 9
% 0.20/0.41 11. (-. (Ex Y, ((p T_0) /\ (q T_0 Y)))) (All X, ((s X) => (p X))) (s T_0) (All X, (All Y, ((r X Y) => (q X Y)))) (r T_0 T_1) ### NotExists 10
% 0.20/0.41 12. (-. (Ex X, (Ex Y, ((p X) /\ (q X Y))))) (r T_0 T_1) (All X, (All Y, ((r X Y) => (q X Y)))) (s T_0) (All X, ((s X) => (p X))) ### NotExists 11
% 0.20/0.41 13. (-. (((s T_2) /\ ((s T_0) /\ ((r T_0 T_1) /\ ((All X, ((s X) => (p X))) /\ (All X, (All Y, ((r X Y) => (q X Y)))))))) => (Ex X, (Ex Y, ((p X) /\ (q X Y)))))) ### ConjTree 12
% 0.20/0.41 14. (-. (All C, (((s T_2) /\ ((s T_0) /\ ((r T_0 C) /\ ((All X, ((s X) => (p X))) /\ (All X, (All Y, ((r X Y) => (q X Y)))))))) => (Ex X, (Ex Y, ((p X) /\ (q X Y))))))) ### NotAllEx 13
% 0.20/0.41 15. (-. (All B, (All C, (((s T_2) /\ ((s B) /\ ((r B C) /\ ((All X, ((s X) => (p X))) /\ (All X, (All Y, ((r X Y) => (q X Y)))))))) => (Ex X, (Ex Y, ((p X) /\ (q X Y)))))))) ### NotAllEx 14
% 0.20/0.41 16. (-. (All A, (All B, (All C, (((s A) /\ ((s B) /\ ((r B C) /\ ((All X, ((s X) => (p X))) /\ (All X, (All Y, ((r X Y) => (q X Y)))))))) => (Ex X, (Ex Y, ((p X) /\ (q X Y))))))))) ### NotAllEx 15
% 0.20/0.41 % SZS output end Proof
% 0.20/0.41 (* END-PROOF *)
%------------------------------------------------------------------------------