↑ Up

Zenon---0.7.1.THM-Prf.s

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

% Computer : n010.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 13:56:45 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN970+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13  % Command  : run_zenon %s %d
% 0.13/0.34  % Computer : n010.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 : Mon Jul 11 12:45:45 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.50  (* PROOF-FOUND *)
% 0.20/0.50  % SZS status Theorem
% 0.20/0.50  (* BEGIN-PROOF *)
% 0.20/0.50  % SZS output start Proof
% 0.20/0.50  Theorem prove_this : (forall A : zenon_U, (forall B : zenon_U, (exists X : zenon_U, (exists Y : zenon_U, (((p X)->(r Y))->((p A)->(r B))))))).
% 0.20/0.50  Proof.
% 0.20/0.50  apply NNPP. intro zenon_G.
% 0.20/0.50  apply (zenon_notallex_s (fun A : zenon_U => (forall B : zenon_U, (exists X : zenon_U, (exists Y : zenon_U, (((p X)->(r Y))->((p A)->(r B))))))) zenon_G); [ zenon_intro zenon_H3; idtac ].
% 0.20/0.50  elim zenon_H3. zenon_intro zenon_TA_e. zenon_intro zenon_H5.
% 0.20/0.50  apply (zenon_notallex_s (fun B : zenon_U => (exists X : zenon_U, (exists Y : zenon_U, (((p X)->(r Y))->((p zenon_TA_e)->(r B)))))) zenon_H5); [ zenon_intro zenon_H6; idtac ].
% 0.20/0.50  elim zenon_H6. zenon_intro zenon_TB_h. zenon_intro zenon_H8.
% 0.20/0.50  apply zenon_H8. exists zenon_TA_e. apply NNPP. zenon_intro zenon_H9.
% 0.20/0.50  apply zenon_H9. exists zenon_TB_h. apply NNPP. zenon_intro zenon_Ha.
% 0.20/0.50  apply (zenon_notimply_s _ _ zenon_Ha). zenon_intro zenon_Hc. zenon_intro zenon_Hb.
% 0.20/0.50  exact (zenon_Hb zenon_Hc).
% 0.20/0.50  Qed.
% 0.20/0.50  % SZS output end Proof
% 0.20/0.50  (* END-PROOF *)
% 0.20/0.50  nodes searched: 24
% 0.20/0.50  max branch formulas: 24
% 0.20/0.50  proof nodes created: 12
% 0.20/0.50  formulas created: 159
% 0.20/0.50  
%------------------------------------------------------------------------------