%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWV167+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 : n006.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:13 EDT 2022 % Result : Theorem 26.10s 26.28s % Output : Proof 26.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWV167+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.13/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.13/0.34 % Computer : n006.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 : Wed Jun 15 13:29:56 EDT 2022 % 0.13/0.34 % CPUTime : % 26.10/26.28 % SZS status Theorem % 26.10/26.28 (* PROOF-FOUND *) % 26.10/26.28 (* BEGIN-PROOF *) % 26.10/26.28 % SZS output start Proof % 26.10/26.28 1. ((mu_init) != (mu_init)) ### NotEqual % 26.10/26.28 2. (gt (succ (pv40)) T_0) (-. (gt (succ (pv40)) T_0)) ### Axiom % 26.10/26.28 3. (-. (leq T_0 (pv40))) (gt (succ (pv40)) T_0) ### Definition-Pseudo(leq) 2 % 26.10/26.28 4. (T_0 != (pv40)) (T_0 = (pv40)) ### Axiom % 26.10/26.28 5. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0))) ### Axiom % 26.10/26.28 6. (-. (leq (n0) T_0)) (gt (succ T_0) (n0)) ### Definition-Pseudo(leq) 5 % 26.10/26.28 7. ((succ (pred (pv40))) = (pv40)) ((succ (pred (pv40))) != (pv40)) ### Axiom % 26.10/26.28 8. (T_0 != T_0) ### Refl(=) % 26.10/26.28 9. (-. (gt (succ (pred (pv40))) T_0)) (gt (pv40) T_0) ((succ (pred (pv40))) = (pv40)) ### Trans 7 8 % 26.10/26.28 10. (-. (leq T_0 (pred (pv40)))) ((succ (pred (pv40))) = (pv40)) (gt (pv40) T_0) ### Definition-Pseudo(leq) 9 % 26.10/26.28 11. ((a_select2 (mu_init) T_0) != (init)) ((a_select2 (mu_init) T_0) = (init)) ### Axiom % 26.10/26.28 12. (((leq (n0) T_0) /\ (leq T_0 (pred (pv40)))) => ((a_select2 (mu_init) T_0) = (init))) ((a_select2 (mu_init) T_0) != (init)) (gt (pv40) T_0) ((succ (pred (pv40))) = (pv40)) (gt (succ T_0) (n0)) ### DisjTree 6 10 11 % 26.10/26.28 13. (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (gt (succ T_0) (n0)) ((succ (pred (pv40))) = (pv40)) (gt (pv40) T_0) ((a_select2 (mu_init) T_0) != (init)) ### All 12 % 26.10/26.28 14. (((leq T_0 (pv40)) /\ (T_0 != (pv40))) => (gt (pv40) T_0)) ((a_select2 (mu_init) T_0) != (init)) ((succ (pred (pv40))) = (pv40)) (gt (succ T_0) (n0)) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (T_0 != (pv40)) (gt (succ (pv40)) T_0) ### DisjTree 3 4 13 % 26.10/26.28 15. (All Y, (((leq T_0 Y) /\ (T_0 != Y)) => (gt Y T_0))) (gt (succ (pv40)) T_0) (T_0 != (pv40)) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (gt (succ T_0) (n0)) ((succ (pred (pv40))) = (pv40)) ((a_select2 (mu_init) T_0) != (init)) ### All 14 % 26.10/26.28 16. (All X, ((succ (pred X)) = X)) ((a_select2 (mu_init) T_0) != (init)) (gt (succ T_0) (n0)) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (T_0 != (pv40)) (gt (succ (pv40)) T_0) (All Y, (((leq T_0 Y) /\ (T_0 != Y)) => (gt Y T_0))) ### All 15 % 26.10/26.28 17. (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (succ (pv40)) T_0) (T_0 != (pv40)) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (gt (succ T_0) (n0)) ((a_select2 (mu_init) T_0) != (init)) (All X, ((succ (pred X)) = X)) ### All 16 % 26.10/26.28 18. ((a_select2 (mu_init) T_0) != (a_select2 (mu_init) (pv40))) (All X, ((succ (pred X)) = X)) ((a_select2 (mu_init) T_0) != (init)) (gt (succ T_0) (n0)) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (gt (succ (pv40)) T_0) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ### NotEqual 1 17 % 26.10/26.28 19. ((init) != (init)) ### NotEqual % 26.10/26.28 20. ((a_select2 (mu_init) (pv40)) = (init)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (gt (succ (pv40)) T_0) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (gt (succ T_0) (n0)) ((a_select2 (mu_init) T_0) != (init)) (All X, ((succ (pred X)) = X)) ### Trans 18 19 % 26.10/26.28 21. (leq T_0 (pv40)) (All X, ((succ (pred X)) = X)) ((a_select2 (mu_init) T_0) != (init)) (gt (succ T_0) (n0)) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ((a_select2 (mu_init) (pv40)) = (init)) ### Definition-Pseudo(leq) 20 % 26.10/26.28 22. (leq (n0) T_0) ((a_select2 (mu_init) (pv40)) = (init)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) ((a_select2 (mu_init) T_0) != (init)) (All X, ((succ (pred X)) = X)) (leq T_0 (pv40)) ### Definition-Pseudo(leq) 21 % 26.10/26.28 23. (-. (((leq (n0) T_0) /\ (leq T_0 (pv40))) => ((a_select2 (mu_init) T_0) = (init)))) (All X, ((succ (pred X)) = X)) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ((a_select2 (mu_init) (pv40)) = (init)) ### ConjTree 22 % 26.10/26.28 24. (-. (All J, (((leq (n0) J) /\ (leq J (pv40))) => ((a_select2 (mu_init) J) = (init))))) ((a_select2 (mu_init) (pv40)) = (init)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) (All X, ((succ (pred X)) = X)) ### NotAllEx 23 % 26.10/26.28 25. (-. ((((a_select2 (mu_init) (pv40)) = (init)) /\ (((a_select2 (sigma_init) (pv40)) = (init)) /\ ((leq (n0) (pv40)) /\ ((leq (pv40) (n4)) /\ ((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_select2 (rho_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (pred (pv40)))) => ((a_select2 (mu_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (pred (pv40)))) => ((a_select2 (sigma_init) E) = (init)))) /\ ((All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select3 (center_init) F (n0)) = (init)))) /\ (((gt (loopcounter) (n1)) => (All G, (((leq (n0) G) /\ (leq G (n4))) => ((a_select2 (muold_init) G) = (init))))) /\ (((gt (loopcounter) (n1)) => (All H, (((leq (n0) H) /\ (leq H (n4))) => ((a_select2 (rhoold_init) H) = (init))))) /\ ((gt (loopcounter) (n1)) => (All I, (((leq (n0) I) /\ (leq I (n4))) => ((a_select2 (sigmaold_init) I) = (init)))))))))))))))) => (All J, (((leq (n0) J) /\ (leq J (pv40))) => ((a_select2 (mu_init) J) = (init)))))) (All X, ((succ (pred X)) = X)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ### ConjTree 24 % 26.10/26.28 % SZS output end Proof % 26.10/26.28 (* END-PROOF *) %------------------------------------------------------------------------------