TSTP Solution File: KRS267+1 by Zenon---0.7.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zenon---0.7.1
% Problem  : KRS267+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_zenon %s %d

% Computer : n021.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 : Sun Jul 17 03:39:53 EDT 2022

% Result   : Theorem 3.99s 4.17s
% Output   : Proof 3.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS267+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.12  % Command  : run_zenon %s %d
% 0.12/0.33  % Computer : n021.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 : Tue Jun  7 08:49:21 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 3.99/4.17  (* PROOF-FOUND *)
% 3.99/4.17  % SZS status Theorem
% 3.99/4.17  (* BEGIN-PROOF *)
% 3.99/4.17  % SZS output start Proof
% 3.99/4.17  Theorem mighta_tca_thm : (mighta (tca) (thm)).
% 3.99/4.17  Proof.
% 3.99/4.17  assert (zenon_L1_ : forall (zenon_TF_bk : zenon_U), (~(~(exists I2 : zenon_U, (model I2 zenon_TF_bk)))) -> (~(exists I2 : zenon_U, (model I2 zenon_TF_bk))) -> False).
% 3.99/4.17  do 1 intro. intros zenon_H22 zenon_H23.
% 3.99/4.17  exact (zenon_H22 zenon_H23).
% 3.99/4.17  (* end of lemma zenon_L1_ *)
% 3.99/4.17  assert (zenon_L2_ : forall (zenon_TF_bn : zenon_U), (exists I4 : zenon_U, (~(model I4 zenon_TF_bn))) -> (forall I : zenon_U, (model I zenon_TF_bn)) -> False).
% 3.99/4.17  do 1 intro. intros zenon_H25 zenon_H26.
% 3.99/4.17  elim zenon_H25. zenon_intro zenon_TI4_bo. zenon_intro zenon_H29.
% 3.99/4.17  generalize (zenon_H26 zenon_TI4_bo). zenon_intro zenon_H2a.
% 3.99/4.17  exact (zenon_H29 zenon_H2a).
% 3.99/4.17  (* end of lemma zenon_L2_ *)
% 3.99/4.17  assert (zenon_L3_ : forall (zenon_TF_bn : zenon_U), (~(forall I : zenon_U, (model I zenon_TF_bn))) -> (forall I : zenon_U, (model I zenon_TF_bn)) -> False).
% 3.99/4.17  do 1 intro. intros zenon_H2b zenon_H26.
% 3.99/4.17  exact (zenon_H2b zenon_H26).
% 3.99/4.17  (* end of lemma zenon_L3_ *)
% 3.99/4.17  assert (zenon_L4_ : forall (zenon_TF_bn : zenon_U) (zenon_TF_bk : zenon_U), (forall C : zenon_U, ((forall I1 : zenon_U, ((model I1 zenon_TF_bk)->(model I1 C)))<->(status zenon_TF_bk C (thm)))) -> (forall I : zenon_U, (~(model I zenon_TF_bk))) -> (forall C : zenon_U, (((~(exists I2 : zenon_U, (model I2 zenon_TF_bk)))/\(forall I2 : zenon_U, (model I2 C)))<->(status zenon_TF_bk C (tca)))) -> (forall I : zenon_U, (model I zenon_TF_bn)) -> (~(exists I2 : zenon_U, (model I2 zenon_TF_bk))) -> (~(exists C : zenon_U, ((status zenon_TF_bk C (tca))/\(status zenon_TF_bk C (thm))))) -> False).
% 3.99/4.17  do 2 intro. intros zenon_H2c zenon_H2d zenon_H2e zenon_H26 zenon_H23 zenon_H2f.
% 3.99/4.17  generalize (zenon_H2c zenon_TF_bn). zenon_intro zenon_H30.
% 3.99/4.17  apply (zenon_equiv_s _ _ zenon_H30); [ zenon_intro zenon_H34; zenon_intro zenon_H33 | zenon_intro zenon_H32; zenon_intro zenon_H31 ].
% 3.99/4.17  apply (zenon_notallex_s (fun I1 : zenon_U => ((model I1 zenon_TF_bk)->(model I1 zenon_TF_bn))) zenon_H34); [ zenon_intro zenon_H35; idtac ].
% 3.99/4.17  elim zenon_H35. zenon_intro zenon_TI1_cc. zenon_intro zenon_H37.
% 3.99/4.17  apply (zenon_notimply_s _ _ zenon_H37). zenon_intro zenon_H39. zenon_intro zenon_H38.
% 3.99/4.17  generalize (zenon_H2d zenon_TI1_cc). zenon_intro zenon_H3a.
% 3.99/4.17  exact (zenon_H3a zenon_H39).
% 3.99/4.17  generalize (zenon_H2e zenon_TF_bn). zenon_intro zenon_H3b.
% 3.99/4.17  apply (zenon_equiv_s _ _ zenon_H3b); [ zenon_intro zenon_H3f; zenon_intro zenon_H3e | zenon_intro zenon_H3d; zenon_intro zenon_H3c ].
% 3.99/4.17  apply (zenon_notand_s _ _ zenon_H3f); [ zenon_intro zenon_H22 | zenon_intro zenon_H2b ].
% 3.99/4.17  exact (zenon_H22 zenon_H23).
% 3.99/4.17  exact (zenon_H2b zenon_H26).
% 3.99/4.17  apply zenon_H2f. exists zenon_TF_bn. apply NNPP. zenon_intro zenon_H40.
% 3.99/4.17  apply (zenon_notand_s _ _ zenon_H40); [ zenon_intro zenon_H3e | zenon_intro zenon_H33 ].
% 3.99/4.17  exact (zenon_H3e zenon_H3c).
% 3.99/4.17  exact (zenon_H33 zenon_H31).
% 3.99/4.17  (* end of lemma zenon_L4_ *)
% 3.99/4.17  apply NNPP. intro zenon_G.
% 3.99/4.17  elim tautology. zenon_intro zenon_TF_bn. zenon_intro zenon_H26.
% 3.99/4.17  elim contradiction. zenon_intro zenon_TF_bk. zenon_intro zenon_H2d.
% 3.99/4.17  generalize (mighta (tca)). zenon_intro zenon_H41.
% 3.99/4.17  generalize (zenon_H41 (thm)). zenon_intro zenon_H42.
% 3.99/4.17  apply (zenon_equiv_s _ _ zenon_H42); [ zenon_intro zenon_H45; zenon_intro zenon_G | zenon_intro zenon_H44; zenon_intro zenon_H43 ].
% 3.99/4.17  apply zenon_H45. exists zenon_TF_bk. apply NNPP. zenon_intro zenon_H2f.
% 3.99/4.17  generalize (thm zenon_TF_bk). zenon_intro zenon_H2c.
% 3.99/4.17  generalize (tca zenon_TF_bk). zenon_intro zenon_H2e.
% 3.99/4.17  generalize (cax zenon_TF_bk). zenon_intro zenon_H0.
% 3.99/4.17  generalize (zenon_H0 zenon_E). zenon_intro zenon_H46.
% 3.99/4.17  apply (zenon_equiv_s _ _ zenon_H46); [ zenon_intro zenon_H22; zenon_intro zenon_H48 | zenon_intro zenon_H23; zenon_intro zenon_H47 ].
% 3.99/4.17  apply zenon_H22. zenon_intro zenon_H49.
% 3.99/4.17  elim zenon_H49. zenon_intro zenon_TI2_cw. zenon_intro zenon_H4b.
% 3.99/4.17  generalize (zenon_H2d zenon_TI2_cw). zenon_intro zenon_H4c.
% 3.99/4.17  exact (zenon_H4c zenon_H4b).
% 3.99/4.17  apply (zenon_L4_ zenon_TF_bn zenon_TF_bk); trivial.
% 3.99/4.17  exact (zenon_G zenon_H43).
% 3.99/4.17  Qed.
% 3.99/4.17  % SZS output end Proof
% 3.99/4.17  (* END-PROOF *)
% 3.99/4.17  nodes searched: 174213
% 3.99/4.17  max branch formulas: 9015
% 3.99/4.17  proof nodes created: 8944
% 3.99/4.17  formulas created: 461183
% 3.99/4.18  
%------------------------------------------------------------------------------