TSTP Solution File: SWV182+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWV182+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 : n023.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 52.70s 52.87s
% Output : Proof 52.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV182+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.14 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 16:18:35 EDT 2022
% 0.15/0.36 % CPUTime :
% 52.70/52.87 % SZS status Theorem
% 52.70/52.87 (* PROOF-FOUND *)
% 52.70/52.87 (* BEGIN-PROOF *)
% 52.70/52.87 % SZS output start Proof
% 52.70/52.87 1. (gt (succ (loopcounter)) (n1)) (-. (gt (succ (loopcounter)) (n1))) ### Axiom
% 52.70/52.87 2. (-. (leq (n1) (loopcounter))) (gt (succ (loopcounter)) (n1)) ### Definition-Pseudo(leq) 1
% 52.70/52.87 3. ((loopcounter) != (n1)) ((n1) = (loopcounter)) ### Sym(=)
% 52.70/52.87 4. (-. (gt (loopcounter) (n1))) (gt (loopcounter) (n1)) ### Axiom
% 52.70/52.87 5. (((leq (n1) (loopcounter)) /\ ((n1) != (loopcounter))) => (gt (loopcounter) (n1))) (-. (gt (loopcounter) (n1))) ((loopcounter) != (n1)) (gt (succ (loopcounter)) (n1)) ### DisjTree 2 3 4
% 52.70/52.87 6. (All Y, (((leq (n1) Y) /\ ((n1) != Y)) => (gt Y (n1)))) (gt (succ (loopcounter)) (n1)) ((loopcounter) != (n1)) (-. (gt (loopcounter) (n1))) ### All 5
% 52.70/52.87 7. (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (-. (gt (loopcounter) (n1))) ((loopcounter) != (n1)) (gt (succ (loopcounter)) (n1)) ### All 6
% 52.70/52.87 8. ((n0) != (n0)) ### NotEqual
% 52.70/52.87 9. (-. (gt (loopcounter) (n0))) (gt (n1) (n0)) (gt (succ (loopcounter)) (n1)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ### Trans 7 8
% 52.70/52.87 10. (-. (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rho_init) E) = (init))))) (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rho_init) E) = (init)))) ### Axiom
% 52.70/52.87 11. ((gt (loopcounter) (n0)) => (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rho_init) E) = (init))))) (-. (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rho_init) E) = (init))))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (succ (loopcounter)) (n1)) (gt (n1) (n0)) ### Imply 9 10
% 52.70/52.87 12. (leq (n1) (loopcounter)) (gt (n1) (n0)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (-. (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rho_init) E) = (init))))) ((gt (loopcounter) (n0)) => (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rho_init) E) = (init))))) ### Definition-Pseudo(leq) 11
% 52.70/52.87 13. (-. (((leq (tptp_float_0_001) (pv76)) /\ ((leq (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 E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rho_init) E) = (init)))))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (n1) (n0)) ### ConjTree 12
% 52.70/52.87 % SZS output end Proof
% 52.70/52.87 (* END-PROOF *)
%------------------------------------------------------------------------------