↑ Up

Zenon---0.7.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zenon---0.7.1
% Problem  : NUM295+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_zenon %s %d

% Computer : n004.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:54:44 EDT 2022

% Result   : Theorem 3.26s 3.51s
% Output   : Proof 3.26s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM295+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13  % Command  : run_zenon %s %d
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jul  7 06:04:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 3.26/3.51  (* PROOF-FOUND *)
% 3.26/3.51  % SZS status Theorem
% 3.26/3.51  (* BEGIN-PROOF *)
% 3.26/3.51  % SZS output start Proof
% 3.26/3.51  Theorem something_less_something : (exists X : zenon_U, (exists Y : zenon_U, (less X Y))).
% 3.26/3.51  Proof.
% 3.26/3.51  assert (zenon_L1_ : (~(exists X : zenon_U, (exists Y : zenon_U, (less X Y)))) -> (less (nn3) (n9)) -> False).
% 3.26/3.51  do 0 intro. intros zenon_G zenon_H192.
% 3.26/3.51  apply zenon_G. exists (nn3). apply NNPP. zenon_intro zenon_H193.
% 3.26/3.51  apply zenon_H193. exists (n9). apply NNPP. zenon_intro zenon_H194.
% 3.26/3.51  exact (zenon_H194 zenon_H192).
% 3.26/3.51  (* end of lemma zenon_L1_ *)
% 3.26/3.51  apply NNPP. intro zenon_G.
% 3.26/3.51  generalize (less_entry_point_neg_pos (nn3)). zenon_intro zenon_H195.
% 3.26/3.51  generalize (zenon_H195 (n9)). zenon_intro zenon_H196.
% 3.26/3.51  generalize (zenon_H196 (rdnn (n3))). zenon_intro zenon_H197.
% 3.26/3.51  generalize (zenon_H197 (rdnn (n9))). zenon_intro zenon_H198.
% 3.26/3.51  apply (zenon_imply_s _ _ zenon_H198); [ zenon_intro zenon_H199 | zenon_intro zenon_H192 ].
% 3.26/3.51  apply (zenon_notand_s _ _ zenon_H199); [ zenon_intro zenon_H19b | zenon_intro zenon_H19a ].
% 3.26/3.51  exact (zenon_H19b rdnn3).
% 3.26/3.51  exact (zenon_H19a rdn9).
% 3.26/3.51  apply (zenon_L1_); trivial.
% 3.26/3.51  Qed.
% 3.26/3.51  % SZS output end Proof
% 3.26/3.51  (* END-PROOF *)
% 3.26/3.51  nodes searched: 250497
% 3.26/3.51  max branch formulas: 15383
% 3.26/3.51  proof nodes created: 2717
% 3.26/3.51  formulas created: 737657
% 3.26/3.51  
%------------------------------------------------------------------------------