%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWV141+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 : n021.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.10s 8.26s % Output : Proof 8.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SWV141+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.13/0.35 % Computer : n021.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Tue Jun 14 23:46:43 EDT 2022 % 0.13/0.35 % CPUTime : % 8.10/8.26 % SZS status Theorem % 8.10/8.26 (* PROOF-FOUND *) % 8.10/8.26 (* BEGIN-PROOF *) % 8.10/8.26 % SZS output start Proof % 8.10/8.26 1. (gt (succ (loopcounter)) (n1)) (-. (gt (succ (loopcounter)) (n1))) ### Axiom % 8.10/8.26 2. (-. (leq (n1) (loopcounter))) (gt (succ (loopcounter)) (n1)) ### Definition-Pseudo(leq) 1 % 8.10/8.26 3. ((loopcounter) != (n1)) ((n1) = (loopcounter)) ### Sym(=) % 8.10/8.26 4. (-. (gt (loopcounter) (n1))) (gt (loopcounter) (n1)) ### Axiom % 8.10/8.26 5. (((leq (n1) (loopcounter)) /\ ((n1) != (loopcounter))) => (gt (loopcounter) (n1))) (-. (gt (loopcounter) (n1))) ((loopcounter) != (n1)) (gt (succ (loopcounter)) (n1)) ### DisjTree 2 3 4 % 8.10/8.26 6. (All Y, (((leq (n1) Y) /\ ((n1) != Y)) => (gt Y (n1)))) (gt (succ (loopcounter)) (n1)) ((loopcounter) != (n1)) (-. (gt (loopcounter) (n1))) ### All 5 % 8.10/8.26 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.10/8.26 8. ((n0) != (n0)) ### NotEqual % 8.10/8.26 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.10/8.26 10. (-. (gt (succ (s_worst7)) (n0))) (gt (succ (s_worst7)) (n0)) ### Axiom % 8.10/8.26 11. (leq (n0) (s_worst7)) (-. (gt (succ (s_worst7)) (n0))) ### Definition-Pseudo(leq) 10 % 8.10/8.26 12. ((gt (loopcounter) (n0)) => (leq (n0) (s_worst7))) (-. (gt (succ (s_worst7)) (n0))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (succ (loopcounter)) (n1)) (gt (n1) (n0)) ### Imply 9 11 % 8.10/8.26 13. (-. (leq (n0) (s_worst7))) (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_worst7))) ### Definition-Pseudo(leq) 12 % 8.10/8.26 14. (leq (n1) (loopcounter)) ((gt (loopcounter) (n0)) => (leq (n0) (s_worst7))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (n1) (n0)) (-. (leq (n0) (s_worst7))) ### Definition-Pseudo(leq) 13 % 8.10/8.26 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_worst7)))) (gt (n1) (n0)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ### ConjTree 14 % 8.10/8.26 % SZS output end Proof % 8.10/8.26 (* END-PROOF *) %------------------------------------------------------------------------------