TSTP Solution File: SWV140+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWV140+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 : n017.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 8.75s 9.01s
% Output : Proof 8.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV140+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.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 06:12:40 EDT 2022
% 0.14/0.36 % CPUTime :
% 8.75/9.01 % SZS status Theorem
% 8.75/9.01 (* PROOF-FOUND *)
% 8.75/9.01 (* BEGIN-PROOF *)
% 8.75/9.01 % SZS output start Proof
% 8.75/9.01 1. (gt (succ (loopcounter)) (n1)) (-. (gt (succ (loopcounter)) (n1))) ### Axiom
% 8.75/9.01 2. (-. (leq (n1) (loopcounter))) (gt (succ (loopcounter)) (n1)) ### Definition-Pseudo(leq) 1
% 8.75/9.01 3. ((loopcounter) != (n1)) ((n1) = (loopcounter)) ### Sym(=)
% 8.75/9.01 4. (-. (gt (loopcounter) (n1))) (gt (loopcounter) (n1)) ### Axiom
% 8.75/9.01 5. (((leq (n1) (loopcounter)) /\ ((n1) != (loopcounter))) => (gt (loopcounter) (n1))) (-. (gt (loopcounter) (n1))) ((loopcounter) != (n1)) (gt (succ (loopcounter)) (n1)) ### DisjTree 2 3 4
% 8.75/9.01 6. (All Y, (((leq (n1) Y) /\ ((n1) != Y)) => (gt Y (n1)))) (gt (succ (loopcounter)) (n1)) ((loopcounter) != (n1)) (-. (gt (loopcounter) (n1))) ### All 5
% 8.75/9.01 7. (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (-. (gt (loopcounter) (n1))) ((loopcounter) != (n1)) (gt (succ (loopcounter)) (n1)) ### All 6
% 8.75/9.01 8. ((n0) != (n0)) ### NotEqual
% 8.75/9.01 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
% 8.75/9.01 10. (-. (gt (succ (s_sworst7)) (n0))) (gt (succ (s_sworst7)) (n0)) ### Axiom
% 8.75/9.01 11. (leq (n0) (s_sworst7)) (-. (gt (succ (s_sworst7)) (n0))) ### Definition-Pseudo(leq) 10
% 8.75/9.01 12. ((gt (loopcounter) (n0)) => (leq (n0) (s_sworst7))) (-. (gt (succ (s_sworst7)) (n0))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (succ (loopcounter)) (n1)) (gt (n1) (n0)) ### Imply 9 11
% 8.75/9.01 13. (-. (leq (n0) (s_sworst7))) (gt (n1) (n0)) (gt (succ (loopcounter)) (n1)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ((gt (loopcounter) (n0)) => (leq (n0) (s_sworst7))) ### Definition-Pseudo(leq) 12
% 8.75/9.01 14. (leq (n1) (loopcounter)) ((gt (loopcounter) (n0)) => (leq (n0) (s_sworst7))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (n1) (n0)) (-. (leq (n0) (s_sworst7))) ### Definition-Pseudo(leq) 13
% 8.75/9.01 15. (-. (((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 (n0) (s_sworst7)))) (gt (n1) (n0)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ### ConjTree 14
% 8.75/9.01 % SZS output end Proof
% 8.75/9.01 (* END-PROOF *)
%------------------------------------------------------------------------------