%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWV078+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_super_zenon -p0 -itptp -om -max-time %d %s

% Computer : n009.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 : Wed Jul 20 21:49:56 EDT 2022

% Result   : Theorem 2.45s 2.62s
% Output   : Proof 2.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV078+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.12  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33  % Computer : n009.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 : Thu Jun 16 05:59:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.45/2.62  % SZS status Theorem
% 2.45/2.62  (* PROOF-FOUND *)
% 2.45/2.62  (* BEGIN-PROOF *)
% 2.45/2.62  % SZS output start Proof
% 2.45/2.62  1. (gt (succ (pv31)) (n0)) (-. (gt (succ (pv31)) (n0)))   ### Axiom
% 2.45/2.62  2. (-. (leq (n0) (pv31))) (gt (succ (pv31)) (n0))   ### Definition-Pseudo(leq) 1
% 2.45/2.62  3. (gt (succ (minus (n5) (n1))) (pv31)) (-. (gt (succ (minus (n5) (n1))) (pv31)))   ### Axiom
% 2.45/2.62  4. (-. (leq (pv31) (minus (n5) (n1)))) (gt (succ (minus (n5) (n1))) (pv31))   ### Definition-Pseudo(leq) 3
% 2.45/2.62  5. (-. ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) (gt (succ (minus (n5) (n1))) (pv31)) (gt (succ (pv31)) (n0))   ### NotAnd 2 4
% 2.45/2.62  6. (-. (((n0) != (pv70)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1)))))) (gt (succ (pv31)) (n0)) (gt (succ (minus (n5) (n1))) (pv31))   ### NotImply 5
% 2.45/2.62  7. (-. (true)) (true)   ### P-NotP
% 2.45/2.62  8. (-. (((n0) = (pv70)) => (true))) (true)   ### NotImply 7
% 2.45/2.62  9. (-. ((((n0) != (pv70)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) /\ (((n0) = (pv70)) => (true)))) (true) (gt (succ (minus (n5) (n1))) (pv31)) (gt (succ (pv31)) (n0))   ### NotAnd 6 8
% 2.45/2.62  10. (leq (pv31) (minus (n5) (n1))) (gt (succ (pv31)) (n0)) (true) (-. ((((n0) != (pv70)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) /\ (((n0) = (pv70)) => (true))))   ### Definition-Pseudo(leq) 9
% 2.45/2.62  11. (leq (n0) (pv31)) (-. ((((n0) != (pv70)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) /\ (((n0) = (pv70)) => (true)))) (true) (leq (pv31) (minus (n5) (n1)))   ### Definition-Pseudo(leq) 10
% 2.45/2.62  12. (-. (((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1)))) => ((((n0) != (pv70)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) /\ (((n0) = (pv70)) => (true))))) (true)   ### ConjTree 11
% 2.45/2.62  % SZS output end Proof
% 2.45/2.62  (* END-PROOF *)
%------------------------------------------------------------------------------