TSTP Solution File: SWV142+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWV142+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 : n020.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:08 EDT 2022
% Result : Theorem 6.64s 6.85s
% Output : Proof 6.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 14:27:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 6.64/6.85 % SZS status Theorem
% 6.64/6.85 (* PROOF-FOUND *)
% 6.64/6.85 (* BEGIN-PROOF *)
% 6.64/6.85 % SZS output start Proof
% 6.64/6.85 1. ((succ (loopcounter)) != (succ (loopcounter))) ### Refl(=)
% 6.64/6.85 2. ((succ (n0)) = (n1)) ((n1) != (succ (n0))) ### Sym(=)
% 6.64/6.85 3. (-. (gt (succ (loopcounter)) (succ (n0)))) (gt (succ (loopcounter)) (n1)) ((succ (n0)) = (n1)) ### Trans 1 2
% 6.64/6.85 4. (-. (leq (succ (n0)) (loopcounter))) ((succ (n0)) = (n1)) (gt (succ (loopcounter)) (n1)) ### Definition-Pseudo(leq) 3
% 6.64/6.85 5. (-. (gt (loopcounter) (n0))) (gt (loopcounter) (n0)) ### Axiom
% 6.64/6.85 6. ((leq (succ (n0)) (loopcounter)) => (gt (loopcounter) (n0))) (-. (gt (loopcounter) (n0))) (gt (succ (loopcounter)) (n1)) ((succ (n0)) = (n1)) ### Imply 4 5
% 6.64/6.85 7. (All Y, ((leq (succ (n0)) Y) => (gt Y (n0)))) ((succ (n0)) = (n1)) (gt (succ (loopcounter)) (n1)) (-. (gt (loopcounter) (n0))) ### All 6
% 6.64/6.85 8. (All X, (All Y, ((leq (succ X) Y) => (gt Y X)))) (-. (gt (loopcounter) (n0))) (gt (succ (loopcounter)) (n1)) ((succ (n0)) = (n1)) ### All 7
% 6.64/6.85 9. (-. (gt (succ (n3)) (s_best7))) (gt (succ (n3)) (s_best7)) ### Axiom
% 6.64/6.85 10. (leq (s_best7) (n3)) (-. (gt (succ (n3)) (s_best7))) ### Definition-Pseudo(leq) 9
% 6.64/6.85 11. ((gt (loopcounter) (n0)) => (leq (s_best7) (n3))) (-. (gt (succ (n3)) (s_best7))) ((succ (n0)) = (n1)) (gt (succ (loopcounter)) (n1)) (All X, (All Y, ((leq (succ X) Y) => (gt Y X)))) ### Imply 8 10
% 6.64/6.85 12. (-. (leq (s_best7) (n3))) (All X, (All Y, ((leq (succ X) Y) => (gt Y X)))) (gt (succ (loopcounter)) (n1)) ((succ (n0)) = (n1)) ((gt (loopcounter) (n0)) => (leq (s_best7) (n3))) ### Definition-Pseudo(leq) 11
% 6.64/6.85 13. (leq (n1) (loopcounter)) ((gt (loopcounter) (n0)) => (leq (s_best7) (n3))) ((succ (n0)) = (n1)) (All X, (All Y, ((leq (succ X) Y) => (gt Y X)))) (-. (leq (s_best7) (n3))) ### Definition-Pseudo(leq) 12
% 6.64/6.85 14. (-. (((leq (tptp_float_0_001) (pv1341)) /\ ((leq (n1) (loopcounter)) /\ (((-. (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)))) (All X, (All Y, ((leq (succ X) Y) => (gt Y X)))) ((succ (n0)) = (n1)) ### ConjTree 13
% 6.64/6.85 % SZS output end Proof
% 6.64/6.85 (* END-PROOF *)
%------------------------------------------------------------------------------