TSTP Solution File: SWV188+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWV188+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 : n018.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:17 EDT 2022
% Result : Theorem 10.64s 10.85s
% Output : Proof 10.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWV188+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.13/0.14 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.14/0.36 % Computer : n018.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 : Tue Jun 14 21:36:14 EDT 2022
% 0.14/0.36 % CPUTime :
% 10.64/10.85 % SZS status Theorem
% 10.64/10.85 (* PROOF-FOUND *)
% 10.64/10.85 (* BEGIN-PROOF *)
% 10.64/10.85 % SZS output start Proof
% 10.64/10.85 1. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0))) ### Axiom
% 10.64/10.85 2. (-. (leq (n0) T_0)) (gt (succ T_0) (n0)) ### Definition-Pseudo(leq) 1
% 10.64/10.85 3. ((succ (succ (n0))) = (n2)) ((n2) != (succ (succ (n0)))) ### Sym(=)
% 10.64/10.85 4. ((succ (n2)) != (succ (succ (succ (n0))))) ((succ (succ (n0))) = (n2)) ### NotEqual 3
% 10.64/10.85 5. ((n3) != (n3)) ### NotEqual
% 10.64/10.85 6. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=)
% 10.64/10.85 7. (-. (gt (n3) (succ (tptp_minus_1)))) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 5 6
% 10.64/10.85 8. (-. (gt (succ (n2)) (succ (tptp_minus_1)))) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) ### TransEq 4 7 7
% 10.64/10.85 9. (T_0 != T_0) ### Refl(=)
% 10.64/10.85 10. (-. (gt (succ (n2)) T_0)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) ### Trans 8 9
% 10.64/10.85 11. (-. (leq T_0 (n2))) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) ### Definition-Pseudo(leq) 10
% 10.64/10.85 12. (T_0 != (n0)) (T_0 = (n0)) ### Axiom
% 10.64/10.85 13. (T_0 != (n1)) (T_0 = (n1)) ### Axiom
% 10.64/10.85 14. (T_0 != (n2)) (T_0 = (n2)) ### Axiom
% 10.64/10.85 15. (((leq (n0) T_0) /\ (leq T_0 (n2))) => ((T_0 = (n0)) \/ ((T_0 = (n1)) \/ (T_0 = (n2))))) (T_0 != (n2)) (T_0 != (n1)) (T_0 != (n0)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) ### DisjTree 2 11 12 13 14
% 10.64/10.85 16. (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n0)) (T_0 != (n1)) (T_0 != (n2)) ### All 15
% 10.64/10.85 17. ((succ (tptp_minus_1)) = (n0)) ((succ (tptp_minus_1)) != (n0)) ### Axiom
% 10.64/10.85 18. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 10.64/10.85 19. (-. (gt (succ (tptp_minus_1)) (n0))) (T_0 != (n2)) (T_0 != (n1)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ### Trans 18 16
% 10.64/10.85 20. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 10.64/10.85 21. (-. (gt (succ (tptp_minus_1)) (succ (tptp_minus_1)))) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n1)) (T_0 != (n2)) ((succ (tptp_minus_1)) = (n0)) ### TransEq2 17 19 20
% 10.64/10.85 22. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 10.64/10.85 23. (-. (gt T_0 (succ (tptp_minus_1)))) (T_0 != (n2)) (T_0 != (n1)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ### TransEq2 16 21 22
% 10.64/10.85 24. ((succ (n0)) != (succ (n0))) ### Refl(=)
% 10.64/10.85 25. ((n1) != (n1)) ### NotEqual
% 10.64/10.85 26. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=)
% 10.64/10.85 27. (-. (gt (n1) (succ (tptp_minus_1)))) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 25 26
% 10.64/10.85 28. (-. (gt (succ (n0)) (succ (tptp_minus_1)))) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) ### TransEq 24 27 27
% 10.64/10.85 29. (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n2)) (-. (gt T_0 (succ (tptp_minus_1)))) ### TransEq2 23 28 28
% 10.64/10.85 30. ((succ (succ (n0))) != (succ (succ (n0)))) ### Refl(=)
% 10.64/10.85 31. ((n2) != (n2)) ### NotEqual
% 10.64/10.85 32. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=)
% 10.64/10.85 33. (-. (gt (n2) (succ (tptp_minus_1)))) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 31 32
% 10.64/10.85 34. (-. (gt (succ (succ (n0))) (succ (tptp_minus_1)))) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ### TransEq 30 33 33
% 10.64/10.85 35. (gt (n2) (n0)) (-. (gt T_0 (succ (tptp_minus_1)))) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (n0)) = (n1)) (gt (n1) (n0)) ### TransEq2 29 34 34
% 10.64/10.85 36. (T_0 != T_0) ### Refl(=)
% 10.64/10.85 37. (-. (gt T_0 T_0)) (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) (gt (n2) (n0)) ### Trans 35 36
% 10.64/10.85 38. (All X, (-. (gt X X))) (gt (n2) (n0)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (n0)) = (n1)) (gt (n1) (n0)) ### All 37
% 10.64/10.85 39. (leq T_0 (tptp_minus_1)) (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (n2) (n0)) (All X, (-. (gt X X))) ### Definition-Pseudo(leq) 38
% 10.64/10.85 40. (leq (n0) T_0) (All X, (-. (gt X X))) (gt (n2) (n0)) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (n0)) = (n1)) (gt (n1) (n0)) (leq T_0 (tptp_minus_1)) ### Definition-Pseudo(leq) 39
% 10.64/10.85 41. (-. (((leq (n0) T_0) /\ (leq T_0 (tptp_minus_1))) => ((a_select2 (mu_init) T_0) = (init)))) (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (n2) (n0)) (All X, (-. (gt X X))) ### ConjTree 40
% 10.64/10.85 42. (-. (All H, (((leq (n0) H) /\ (leq H (tptp_minus_1))) => ((a_select2 (mu_init) H) = (init))))) (All X, (-. (gt X X))) (gt (n2) (n0)) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (n0)) = (n1)) (gt (n1) (n0)) ### NotAllEx 41
% 10.64/10.85 43. (-. (((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 (n4))) => ((a_select3 (center_init) D (n0)) = (init)))) /\ (((gt (loopcounter) (n1)) => (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (muold_init) E) = (init))))) /\ (((gt (loopcounter) (n1)) => (All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select2 (rhoold_init) F) = (init))))) /\ ((gt (loopcounter) (n1)) => (All G, (((leq (n0) G) /\ (leq G (n4))) => ((a_select2 (sigmaold_init) G) = (init)))))))))) => (All H, (((leq (n0) H) /\ (leq H (tptp_minus_1))) => ((a_select2 (mu_init) H) = (init)))))) (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (n2) (n0)) (All X, (-. (gt X X))) ### ConjTree 42
% 10.64/10.85 % SZS output end Proof
% 10.64/10.85 (* END-PROOF *)
%------------------------------------------------------------------------------