TSTP Solution File: SWV083+1 by SuperZenon---0.0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWV083+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 : n019.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:57 EDT 2022

% Result   : Theorem 2.42s 2.67s
% Output   : Proof 2.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWV083+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.34  % Computer : n019.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jun 15 01:09:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 2.42/2.67  % SZS status Theorem
% 2.42/2.67  (* PROOF-FOUND *)
% 2.42/2.67  (* BEGIN-PROOF *)
% 2.42/2.67  % SZS output start Proof
% 2.42/2.67  1. (gt (succ (pv66)) (n0)) (-. (gt (succ (pv66)) (n0)))   ### Axiom
% 2.42/2.67  2. (-. (leq (n0) (pv66))) (gt (succ (pv66)) (n0))   ### Definition-Pseudo(leq) 1
% 2.42/2.67  3. (gt (succ (minus (n5) (n1))) (pv66)) (-. (gt (succ (minus (n5) (n1))) (pv66)))   ### Axiom
% 2.42/2.67  4. (-. (leq (pv66) (minus (n5) (n1)))) (gt (succ (minus (n5) (n1))) (pv66))   ### Definition-Pseudo(leq) 3
% 2.42/2.67  5. (-. ((leq (n0) (pv66)) /\ (leq (pv66) (minus (n5) (n1))))) (gt (succ (minus (n5) (n1))) (pv66)) (gt (succ (pv66)) (n0))   ### NotAnd 2 4
% 2.42/2.67  6. (leq (pv66) (minus (n5) (n1))) (gt (succ (pv66)) (n0)) (-. ((leq (n0) (pv66)) /\ (leq (pv66) (minus (n5) (n1)))))   ### Definition-Pseudo(leq) 5
% 2.42/2.67  7. (leq (n0) (pv66)) (-. ((leq (n0) (pv66)) /\ (leq (pv66) (minus (n5) (n1))))) (leq (pv66) (minus (n5) (n1)))   ### Definition-Pseudo(leq) 6
% 2.42/2.67  8. (-. (((leq (n0) (pv66)) /\ (leq (pv66) (minus (n5) (n1)))) => ((leq (n0) (pv66)) /\ (leq (pv66) (minus (n5) (n1))))))   ### ConjTree 7
% 2.42/2.67  % SZS output end Proof
% 2.42/2.67  (* END-PROOF *)
%------------------------------------------------------------------------------