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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWV132+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 : n029.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:50:06 EDT 2022

% Result   : Theorem 2.44s 2.69s
% Output   : Proof 2.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWV132+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 : n029.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 : Thu Jun 16 05:34:12 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 2.44/2.69  % SZS status Theorem
% 2.44/2.69  (* PROOF-FOUND *)
% 2.44/2.69  (* BEGIN-PROOF *)
% 2.44/2.69  % SZS output start Proof
% 2.44/2.69  1. (-. (gt (succ (pv1341)) (tptp_float_0_001))) (gt (succ (pv1341)) (tptp_float_0_001))   ### Axiom
% 2.44/2.69  2. (leq (tptp_float_0_001) (pv1341)) (-. (gt (succ (pv1341)) (tptp_float_0_001)))   ### Definition-Pseudo(leq) 1
% 2.44/2.69  3. (-. (-. (leq (tptp_float_0_001) (pv1341)))) (-. (gt (succ (pv1341)) (tptp_float_0_001)))   ### NotNot 2
% 2.44/2.69  4. (-. (gt (succ (n3)) (s_best7))) (gt (succ (n3)) (s_best7))   ### Axiom
% 2.44/2.69  5. (leq (s_best7) (n3)) (-. (gt (succ (n3)) (s_best7)))   ### Definition-Pseudo(leq) 4
% 2.44/2.69  6. ((-. (leq (tptp_float_0_001) (pv1341))) => (leq (s_best7) (n3))) (-. (gt (succ (n3)) (s_best7))) (-. (gt (succ (pv1341)) (tptp_float_0_001)))   ### Imply 3 5
% 2.44/2.69  7. (-. (leq (s_best7) (n3))) (-. (gt (succ (pv1341)) (tptp_float_0_001))) ((-. (leq (tptp_float_0_001) (pv1341))) => (leq (s_best7) (n3)))   ### Definition-Pseudo(leq) 6
% 2.44/2.69  8. (-. (leq (tptp_float_0_001) (pv1341))) ((-. (leq (tptp_float_0_001) (pv1341))) => (leq (s_best7) (n3))) (-. (leq (s_best7) (n3)))   ### Definition-Pseudo(leq) 7
% 2.44/2.69  9. (-. (((-. (leq (tptp_float_0_001) (pv1341))) /\ (((-. (leq (tptp_float_0_001) (pv1341))) => (leq (n0) (s_best7))) /\ (((-. (leq (tptp_float_0_001) (pv1341))) => (leq (n0) (s_sworst7))) /\ (((-. (leq (tptp_float_0_001) (pv1341))) => (leq (n0) (s_worst7))) /\ (((-. (leq (tptp_float_0_001) (pv1341))) => (leq (s_best7) (n3))) /\ (((-. (leq (tptp_float_0_001) (pv1341))) => (leq (s_sworst7) (n3))) /\ (((-. (leq (tptp_float_0_001) (pv1341))) => (leq (s_worst7) (n3))) /\ (((gt (loopcounter) (n0)) => (leq (n0) (s_best7))) /\ (((gt (loopcounter) (n0)) => (leq (n0) (s_sworst7))) /\ (((gt (loopcounter) (n0)) => (leq (n0) (s_worst7))) /\ (((gt (loopcounter) (n0)) => (leq (s_best7) (n3))) /\ (((gt (loopcounter) (n0)) => (leq (s_sworst7) (n3))) /\ ((gt (loopcounter) (n0)) => (leq (s_worst7) (n3))))))))))))))) => (leq (s_best7) (n3))))   ### ConjTree 8
% 2.44/2.69  % SZS output end Proof
% 2.44/2.69  (* END-PROOF *)
%------------------------------------------------------------------------------