TSTP Solution File: SYN954+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SYN954+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 : n015.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:29 EDT 2022
% Result : Theorem 0.20s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN954+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Mon Jul 11 17:29:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.40 % SZS status Theorem
% 0.20/0.40 (* PROOF-FOUND *)
% 0.20/0.40 (* BEGIN-PROOF *)
% 0.20/0.40 % SZS output start Proof
% 0.20/0.40 1. (-. (p T_0)) (p T_0) ### Axiom
% 0.20/0.40 2. (-. ((p T_0) => (p T_0))) (-. (p T_0)) ### NotImply 1
% 0.20/0.40 3. (-. (p T_1)) (p T_1) ### Axiom
% 0.20/0.40 4. (-. ((p T_1) => (p T_0))) (-. (p T_1)) ### NotImply 3
% 0.20/0.40 5. (-. (q T_1)) (q T_1) ### Axiom
% 0.20/0.40 6. (-. ((q T_1) => (p T_1))) (-. (q T_1)) ### NotImply 5
% 0.20/0.40 7. (-. (((p T_1) => (p T_0)) /\ ((q T_1) => (p T_1)))) (-. (q T_1)) (-. (p T_1)) ### NotAnd 4 6
% 0.20/0.40 8. (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) (-. (p T_1)) (-. (q T_1)) ### NotExists 7
% 0.20/0.40 9. (-. (p T_1)) (p T_1) ### Axiom
% 0.20/0.40 10. ((q T_1) => (p T_1)) (-. (p T_1)) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) ### Imply 8 9
% 0.20/0.40 11. (All Z, ((q Z) => (p Z))) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) (-. (p T_1)) ### All 10
% 0.20/0.40 12. (-. ((q T_0) => (p T_1))) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) (All Z, ((q Z) => (p Z))) ### NotImply 11
% 0.20/0.40 13. (-. (((p T_0) => (p T_0)) /\ ((q T_0) => (p T_1)))) (All Z, ((q Z) => (p Z))) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) (-. (p T_0)) ### NotAnd 2 12
% 0.20/0.40 14. (-. (p T_0)) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) (All Z, ((q Z) => (p Z))) ### NotExists 13
% 0.20/0.40 15. (-. ((p zenon_X2) => (p T_0))) (All Z, ((q Z) => (p Z))) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) ### NotImply 14
% 0.20/0.40 16. (-. ((q zenon_X2) => (p T_1))) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) (All Z, ((q Z) => (p Z))) ### NotImply 11
% 0.20/0.40 17. (-. (((p zenon_X2) => (p T_0)) /\ ((q zenon_X2) => (p T_1)))) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) (All Z, ((q Z) => (p Z))) ### NotAnd 15 16
% 0.20/0.40 18. (All Z, ((q Z) => (p Z))) (-. (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1))))) ### NotExists 17
% 0.20/0.40 19. (-. ((All Z, ((q Z) => (p Z))) => (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p T_1)))))) ### NotImply 18
% 0.20/0.40 20. (-. (All B, ((All Z, ((q Z) => (p Z))) => (Ex X, (((p X) => (p T_0)) /\ ((q X) => (p B))))))) ### NotAllEx 19
% 0.20/0.40 21. (-. (All A, (All B, ((All Z, ((q Z) => (p Z))) => (Ex X, (((p X) => (p A)) /\ ((q X) => (p B)))))))) ### NotAllEx 20
% 0.20/0.40 % SZS output end Proof
% 0.20/0.40 (* END-PROOF *)
%------------------------------------------------------------------------------