%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWV181+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 : n011.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:16 EDT 2022

% Result   : Theorem 65.82s 66.02s
% Output   : Proof 65.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWV181+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.10/0.12  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.33  % Computer : n011.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jun 15 07:58:20 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 65.82/66.02  % SZS status Theorem
% 65.82/66.02  (* PROOF-FOUND *)
% 65.82/66.02  (* BEGIN-PROOF *)
% 65.82/66.02  % SZS output start Proof
% 65.82/66.02  1. (gt (succ (loopcounter)) (n1)) (-. (gt (succ (loopcounter)) (n1)))   ### Axiom
% 65.82/66.02  2. (-. (leq (n1) (loopcounter))) (gt (succ (loopcounter)) (n1))   ### Definition-Pseudo(leq) 1
% 65.82/66.02  3. ((loopcounter) != (n1)) ((n1) = (loopcounter))   ### Sym(=)
% 65.82/66.02  4. (-. (gt (loopcounter) (n1))) (gt (loopcounter) (n1))   ### Axiom
% 65.82/66.02  5. (((leq (n1) (loopcounter)) /\ ((n1) != (loopcounter))) => (gt (loopcounter) (n1))) (-. (gt (loopcounter) (n1))) ((loopcounter) != (n1)) (gt (succ (loopcounter)) (n1))   ### DisjTree 2 3 4
% 65.82/66.02  6. (All Y, (((leq (n1) Y) /\ ((n1) != Y)) => (gt Y (n1)))) (gt (succ (loopcounter)) (n1)) ((loopcounter) != (n1)) (-. (gt (loopcounter) (n1)))   ### All 5
% 65.82/66.02  7. ((loopcounter) != (loopcounter))   ### NotEqual
% 65.82/66.02  8. (-. (gt (loopcounter) (loopcounter))) (gt (n1) (loopcounter)) (gt (succ (loopcounter)) (n1)) (All Y, (((leq (n1) Y) /\ ((n1) != Y)) => (gt Y (n1))))   ### Trans 6 7
% 65.82/66.02  9. (All X, (-. (gt X X))) (All Y, (((leq (n1) Y) /\ ((n1) != Y)) => (gt Y (n1)))) (gt (succ (loopcounter)) (n1)) (gt (n1) (loopcounter))   ### All 8
% 65.82/66.02  10. (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (n1) (loopcounter)) (gt (succ (loopcounter)) (n1)) (All X, (-. (gt X X)))   ### All 9
% 65.82/66.02  11. (leq (n1) (loopcounter)) (All X, (-. (gt X X))) (gt (n1) (loopcounter)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X))))   ### Definition-Pseudo(leq) 10
% 65.82/66.02  12. (-. (((leq (tptp_float_0_001) (pv76)) /\ ((leq (n1) (loopcounter)) /\ ((gt (n1) (loopcounter)) /\ ((All A, (((leq (n0) A) /\ (leq A (n135299))) => (All B, (((leq (n0) B) /\ (leq B (n4))) => ((a_select3 (q_init) A B) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n4))) => ((a_select3 (center_init) C (n0)) = (init)))) /\ (((gt (loopcounter) (n0)) => (All D, (((leq (n0) D) /\ (leq D (n4))) => ((a_select2 (mu_init) D) = (init))))) /\ (((gt (loopcounter) (n0)) => (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rho_init) E) = (init))))) /\ ((gt (loopcounter) (n0)) => (All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select2 (sigma_init) F) = (init)))))))))))) => (All G, (((leq (n0) G) /\ (leq G (n4))) => ((a_select2 (muold_init) G) = (init)))))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (All X, (-. (gt X X)))   ### ConjTree 11
% 65.82/66.02  % SZS output end Proof
% 65.82/66.02  (* END-PROOF *)
%------------------------------------------------------------------------------