## TSTP Solution File: SYN721+1 by Zenon---0.7.1

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : Zenon---0.7.1
% Problem  : SYN721+1 : TPTP v8.1.0. Released v2.5.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 : Thu Jul 21 13:55:16 EDT 2022

% Result   : Theorem 0.21s 0.52s
% Output   : Proof 0.21s
% Verified :
% SZS Type : -

%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN721+1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : run_zenon %s %d
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jul 11 20:48:59 EDT 2022
% 0.14/0.35  % CPUTime  :
% 0.21/0.52  (* PROOF-FOUND *)
% 0.21/0.52  % SZS status Theorem
% 0.21/0.52  (* BEGIN-PROOF *)
% 0.21/0.52  % SZS output start Proof
% 0.21/0.52  Theorem lx1 : (((r (a) (b))/\((forall X : zenon_U, ((exists Y : zenon_U, (r X Y))->(q X X)))/\(forall U : zenon_U, (forall V : zenon_U, ((q U V)->(forall Z : zenon_U, (r Z V)))))))->(exists W : zenon_U, ((r (b) W)/\(q W (a))))).
% 0.21/0.52  Proof.
% 0.21/0.52  assert (zenon_L1_ : (forall Z : zenon_U, (r Z (a))) -> (~(r (b) (a))) -> False).
% 0.21/0.52  do 0 intro. intros zenon_H1 zenon_H2.
% 0.21/0.52  generalize (zenon_H1 (b)). zenon_intro zenon_H3.
% 0.21/0.52  exact (zenon_H2 zenon_H3).
% 0.21/0.52  (* end of lemma zenon_L1_ *)
% 0.21/0.52  apply NNPP. intro zenon_G.
% 0.21/0.52  apply (zenon_notimply_s _ _ zenon_G). zenon_intro zenon_H5. zenon_intro zenon_H4.
% 0.21/0.52  apply (zenon_and_s _ _ zenon_H5). zenon_intro zenon_H7. zenon_intro zenon_H6.
% 0.21/0.52  apply (zenon_and_s _ _ zenon_H6). zenon_intro zenon_H9. zenon_intro zenon_H8.
% 0.21/0.52  generalize (zenon_H9 (a)). zenon_intro zenon_Ha.
% 0.21/0.52  apply (zenon_imply_s _ _ zenon_Ha); [ zenon_intro zenon_Hc | zenon_intro zenon_Hb ].
% 0.21/0.52  apply zenon_Hc. exists (b). apply NNPP. zenon_intro zenon_Hd.
% 0.21/0.52  exact (zenon_Hd zenon_H7).
% 0.21/0.52  apply zenon_H4. exists (a). apply NNPP. zenon_intro zenon_He.
% 0.21/0.52  apply (zenon_notand_s _ _ zenon_He); [ zenon_intro zenon_H2 | zenon_intro zenon_Hf ].
% 0.21/0.52  generalize (zenon_H8 (a)). zenon_intro zenon_H10.
% 0.21/0.52  generalize (zenon_H10 (a)). zenon_intro zenon_H11.
% 0.21/0.52  apply (zenon_imply_s _ _ zenon_H11); [ zenon_intro zenon_Hf | zenon_intro zenon_H1 ].
% 0.21/0.52  exact (zenon_Hf zenon_Hb).
% 0.21/0.52  apply (zenon_L1_); trivial.
% 0.21/0.52  exact (zenon_Hf zenon_Hb).
% 0.21/0.52  Qed.
% 0.21/0.52  % SZS output end Proof
% 0.21/0.52  (* END-PROOF *)
% 0.21/0.52  nodes searched: 63
% 0.21/0.52  max branch formulas: 42
% 0.21/0.52  proof nodes created: 16
% 0.21/0.52  formulas created: 331
% 0.21/0.52
%------------------------------------------------------------------------------
```