TSTP Solution File: NUM571+1 by Zenon---0.7.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zenon---0.7.1
% Problem : NUM571+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_zenon %s %d
% 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 : Mon Jul 18 15:56:56 EDT 2022
% Result : Theorem 0.38s 0.60s
% Output : Proof 0.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : NUM571+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.12 % Command : run_zenon %s %d
% 0.11/0.33 % Computer : n013.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jul 6 15:08:14 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.38/0.60 (* PROOF-FOUND *)
% 0.38/0.60 % SZS status Theorem
% 0.38/0.60 (* BEGIN-PROOF *)
% 0.38/0.60 % SZS output start Proof
% 0.38/0.60 Theorem m__ : ((aSubsetOf0 (sdtlpdtrp0 (xN) (xi)) (szNzAzT0))/\(isCountable0 (sdtlpdtrp0 (xN) (xi)))).
% 0.38/0.60 Proof.
% 0.38/0.60 assert (zenon_L1_ : (~((xN) = (xN))) -> False).
% 0.38/0.60 do 0 intro. intros zenon_H54.
% 0.38/0.60 apply zenon_H54. apply refl_equal.
% 0.38/0.60 (* end of lemma zenon_L1_ *)
% 0.38/0.60 assert (zenon_L2_ : ((sdtlpdtrp0 (xN) (sz00)) = (xS)) -> ((xi) = (sz00)) -> (~((xS) = (sdtlpdtrp0 (xN) (xi)))) -> False).
% 0.38/0.60 do 0 intro. intros zenon_H55 zenon_H56 zenon_H57.
% 0.38/0.60 elim (classic ((sdtlpdtrp0 (xN) (xi)) = (sdtlpdtrp0 (xN) (xi)))); [ zenon_intro zenon_H58 | zenon_intro zenon_H59 ].
% 0.38/0.60 cut (((sdtlpdtrp0 (xN) (xi)) = (sdtlpdtrp0 (xN) (xi))) = ((xS) = (sdtlpdtrp0 (xN) (xi)))).
% 0.38/0.60 intro zenon_D_pnotp.
% 0.38/0.60 apply zenon_H57.
% 0.38/0.60 rewrite <- zenon_D_pnotp.
% 0.38/0.60 exact zenon_H58.
% 0.38/0.60 cut (((sdtlpdtrp0 (xN) (xi)) = (sdtlpdtrp0 (xN) (xi)))); [idtac | apply NNPP; zenon_intro zenon_H59].
% 0.38/0.60 cut (((sdtlpdtrp0 (xN) (xi)) = (xS))); [idtac | apply NNPP; zenon_intro zenon_H5a].
% 0.38/0.60 congruence.
% 0.38/0.60 cut (((sdtlpdtrp0 (xN) (sz00)) = (xS)) = ((sdtlpdtrp0 (xN) (xi)) = (xS))).
% 0.38/0.60 intro zenon_D_pnotp.
% 0.38/0.60 apply zenon_H5a.
% 0.38/0.60 rewrite <- zenon_D_pnotp.
% 0.38/0.60 exact zenon_H55.
% 0.38/0.60 cut (((xS) = (xS))); [idtac | apply NNPP; zenon_intro zenon_H5b].
% 0.38/0.60 cut (((sdtlpdtrp0 (xN) (sz00)) = (sdtlpdtrp0 (xN) (xi)))); [idtac | apply NNPP; zenon_intro zenon_H5c].
% 0.38/0.60 congruence.
% 0.38/0.60 elim (classic ((sdtlpdtrp0 (xN) (xi)) = (sdtlpdtrp0 (xN) (xi)))); [ zenon_intro zenon_H58 | zenon_intro zenon_H59 ].
% 0.38/0.60 cut (((sdtlpdtrp0 (xN) (xi)) = (sdtlpdtrp0 (xN) (xi))) = ((sdtlpdtrp0 (xN) (sz00)) = (sdtlpdtrp0 (xN) (xi)))).
% 0.38/0.60 intro zenon_D_pnotp.
% 0.38/0.60 apply zenon_H5c.
% 0.38/0.60 rewrite <- zenon_D_pnotp.
% 0.38/0.60 exact zenon_H58.
% 0.38/0.60 cut (((sdtlpdtrp0 (xN) (xi)) = (sdtlpdtrp0 (xN) (xi)))); [idtac | apply NNPP; zenon_intro zenon_H59].
% 0.38/0.60 cut (((sdtlpdtrp0 (xN) (xi)) = (sdtlpdtrp0 (xN) (sz00)))); [idtac | apply NNPP; zenon_intro zenon_H5d].
% 0.38/0.60 congruence.
% 0.38/0.60 cut (((xi) = (sz00))); [idtac | apply NNPP; zenon_intro zenon_H5e].
% 0.38/0.60 cut (((xN) = (xN))); [idtac | apply NNPP; zenon_intro zenon_H54].
% 0.38/0.60 congruence.
% 0.38/0.60 apply zenon_H54. apply refl_equal.
% 0.38/0.60 exact (zenon_H5e zenon_H56).
% 0.38/0.60 apply zenon_H59. apply refl_equal.
% 0.38/0.60 apply zenon_H59. apply refl_equal.
% 0.38/0.60 apply zenon_H5b. apply refl_equal.
% 0.38/0.60 apply zenon_H59. apply refl_equal.
% 0.38/0.60 apply zenon_H59. apply refl_equal.
% 0.38/0.60 (* end of lemma zenon_L2_ *)
% 0.38/0.60 assert (zenon_L3_ : (~((szNzAzT0) = (szNzAzT0))) -> False).
% 0.38/0.60 do 0 intro. intros zenon_H5f.
% 0.38/0.60 apply zenon_H5f. apply refl_equal.
% 0.38/0.60 (* end of lemma zenon_L3_ *)
% 0.38/0.60 apply NNPP. intro zenon_G.
% 0.38/0.60 apply (zenon_and_s _ _ m__3435). zenon_intro zenon_H61. zenon_intro zenon_H60.
% 0.38/0.60 apply (zenon_and_s _ _ m__3623). zenon_intro zenon_H63. zenon_intro zenon_H62.
% 0.38/0.60 apply (zenon_and_s _ _ zenon_H62). zenon_intro zenon_H65. zenon_intro zenon_H64.
% 0.38/0.60 apply (zenon_and_s _ _ zenon_H64). zenon_intro zenon_H55. zenon_intro zenon_H66.
% 0.38/0.60 apply (zenon_imply_s _ _ m__3702_02); [ zenon_intro zenon_H68 | zenon_intro zenon_H67 ].
% 0.38/0.60 apply zenon_H68. zenon_intro zenon_H56.
% 0.38/0.60 apply (zenon_notand_s _ _ zenon_G); [ zenon_intro zenon_H6a | zenon_intro zenon_H69 ].
% 0.38/0.60 cut ((aSubsetOf0 (xS) (szNzAzT0)) = (aSubsetOf0 (sdtlpdtrp0 (xN) (xi)) (szNzAzT0))).
% 0.38/0.60 intro zenon_D_pnotp.
% 0.38/0.60 apply zenon_H6a.
% 0.38/0.60 rewrite <- zenon_D_pnotp.
% 0.38/0.60 exact zenon_H61.
% 0.38/0.60 cut (((szNzAzT0) = (szNzAzT0))); [idtac | apply NNPP; zenon_intro zenon_H5f].
% 0.38/0.60 cut (((xS) = (sdtlpdtrp0 (xN) (xi)))); [idtac | apply NNPP; zenon_intro zenon_H57].
% 0.38/0.60 congruence.
% 0.38/0.60 apply (zenon_L2_); trivial.
% 0.38/0.60 apply zenon_H5f. apply refl_equal.
% 0.38/0.60 cut ((isCountable0 (xS)) = (isCountable0 (sdtlpdtrp0 (xN) (xi)))).
% 0.38/0.60 intro zenon_D_pnotp.
% 0.38/0.60 apply zenon_H69.
% 0.38/0.60 rewrite <- zenon_D_pnotp.
% 0.38/0.60 exact zenon_H60.
% 0.38/0.60 cut (((xS) = (sdtlpdtrp0 (xN) (xi)))); [idtac | apply NNPP; zenon_intro zenon_H57].
% 0.38/0.60 congruence.
% 0.38/0.60 apply (zenon_L2_); trivial.
% 0.38/0.60 apply (zenon_and_s _ _ zenon_H67). zenon_intro zenon_H6c. zenon_intro zenon_H6b.
% 0.38/0.60 exact (zenon_G zenon_H6b).
% 0.38/0.60 Qed.
% 0.38/0.60 % SZS output end Proof
% 0.38/0.60 (* END-PROOF *)
% 0.38/0.60 nodes searched: 2978
% 0.38/0.60 max branch formulas: 1266
% 0.38/0.60 proof nodes created: 55
% 0.38/0.60 formulas created: 20091
% 0.38/0.60
%------------------------------------------------------------------------------