TSTP Solution File: SWV163+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWV163+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 : n028.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:12 EDT 2022
% Result : Theorem 6.35s 6.62s
% Output : Proof 6.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV163+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 18:44:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 6.35/6.62 % SZS status Theorem
% 6.35/6.62 (* PROOF-FOUND *)
% 6.35/6.62 (* BEGIN-PROOF *)
% 6.35/6.62 % SZS output start Proof
% 6.35/6.62 1. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0))) ### Axiom
% 6.35/6.62 2. (-. (leq (n0) T_0)) (gt (succ T_0) (n0)) ### Definition-Pseudo(leq) 1
% 6.35/6.62 3. ((succ (n0)) = (n1)) ((n1) != (succ (n0))) ### Sym(=)
% 6.35/6.62 4. ((succ (n1)) != (succ (succ (n0)))) ((succ (n0)) = (n1)) ### NotEqual 3
% 6.35/6.62 5. ((n2) != (n2)) ### NotEqual
% 6.35/6.62 6. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=)
% 6.35/6.62 7. (-. (gt (n2) (succ (tptp_minus_1)))) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 5 6
% 6.35/6.62 8. (-. (gt (succ (n1)) (succ (tptp_minus_1)))) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ((succ (n0)) = (n1)) ### TransEq 4 7 7
% 6.35/6.62 9. (T_0 != T_0) ### Refl(=)
% 6.35/6.62 10. (-. (gt (succ (n1)) T_0)) (gt (succ (tptp_minus_1)) T_0) ((succ (n0)) = (n1)) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (n0))) = (n2)) ### Trans 8 9
% 6.35/6.62 11. (-. (leq T_0 (n1))) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ((succ (n0)) = (n1)) (gt (succ (tptp_minus_1)) T_0) ### Definition-Pseudo(leq) 10
% 6.35/6.62 12. (T_0 != (n0)) (T_0 = (n0)) ### Axiom
% 6.35/6.62 13. (T_0 != (n1)) (T_0 = (n1)) ### Axiom
% 6.35/6.62 14. (((leq (n0) T_0) /\ (leq T_0 (n1))) => ((T_0 = (n0)) \/ (T_0 = (n1)))) (T_0 != (n1)) (T_0 != (n0)) (gt (succ (tptp_minus_1)) T_0) ((succ (n0)) = (n1)) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (n0))) = (n2)) (gt (succ T_0) (n0)) ### DisjTree 2 11 12 13
% 6.35/6.62 15. (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) (gt (succ T_0) (n0)) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ((succ (n0)) = (n1)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n0)) (T_0 != (n1)) ### All 14
% 6.35/6.62 16. ((succ (tptp_minus_1)) = (n0)) ((succ (tptp_minus_1)) != (n0)) ### Axiom
% 6.35/6.62 17. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 6.35/6.62 18. (-. (gt (succ (tptp_minus_1)) (n0))) (T_0 != (n1)) (gt (succ (tptp_minus_1)) T_0) ((succ (n0)) = (n1)) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (n0))) = (n2)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) ### Trans 17 15
% 6.35/6.62 19. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 6.35/6.62 20. (-. (gt (succ (tptp_minus_1)) (succ (tptp_minus_1)))) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) (gt (succ T_0) (n0)) ((succ (succ (n0))) = (n2)) (gt (n2) (n0)) ((succ (n0)) = (n1)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n1)) ((succ (tptp_minus_1)) = (n0)) ### TransEq2 16 18 19
% 6.35/6.62 21. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 6.35/6.62 22. (-. (gt T_0 (succ (tptp_minus_1)))) (T_0 != (n1)) (gt (succ (tptp_minus_1)) T_0) ((succ (n0)) = (n1)) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (n0))) = (n2)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) ### TransEq2 15 20 21
% 6.35/6.62 23. ((succ (n0)) != (succ (n0))) ### Refl(=)
% 6.35/6.62 24. ((n1) != (n1)) ### NotEqual
% 6.35/6.62 25. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=)
% 6.35/6.62 26. (-. (gt (n1) (succ (tptp_minus_1)))) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 24 25
% 6.35/6.62 27. (-. (gt (succ (n0)) (succ (tptp_minus_1)))) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) ### TransEq 23 26 26
% 6.35/6.62 28. (gt (n1) (n0)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) (gt (succ T_0) (n0)) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ((succ (n0)) = (n1)) (gt (succ (tptp_minus_1)) T_0) (-. (gt T_0 (succ (tptp_minus_1)))) ### TransEq2 22 27 27
% 6.35/6.62 29. (T_0 != T_0) ### Refl(=)
% 6.35/6.62 30. (-. (gt T_0 T_0)) (gt (succ (tptp_minus_1)) T_0) ((succ (n0)) = (n1)) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (n0))) = (n2)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) (gt (n1) (n0)) ### Trans 28 29
% 6.35/6.62 31. (All X, (-. (gt X X))) (gt (n1) (n0)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) (gt (succ T_0) (n0)) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ((succ (n0)) = (n1)) (gt (succ (tptp_minus_1)) T_0) ### All 30
% 6.35/6.62 32. (leq T_0 (tptp_minus_1)) ((succ (n0)) = (n1)) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (n0))) = (n2)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) (gt (n1) (n0)) (All X, (-. (gt X X))) ### Definition-Pseudo(leq) 31
% 6.35/6.62 33. (leq (n0) T_0) (All X, (-. (gt X X))) (gt (n1) (n0)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ((succ (n0)) = (n1)) (leq T_0 (tptp_minus_1)) ### Definition-Pseudo(leq) 32
% 6.35/6.62 34. (-. (((leq (n0) T_0) /\ (leq T_0 (tptp_minus_1))) => ((a_select3 (q) (pv10) T_0) = (divide (sqrt (times (minus (a_select3 (center) T_0 (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) T_0 (n0)) (a_select2 (x) (pv10))))) (sum (n0) (n4) (sqrt (times (minus (a_select3 (center) (tptp_sum_index) (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) (tptp_sum_index) (n0)) (a_select2 (x) (pv10)))))))))) ((succ (n0)) = (n1)) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (n0))) = (n2)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) (gt (n1) (n0)) (All X, (-. (gt X X))) ### ConjTree 33
% 6.35/6.62 35. (-. (All B, (((leq (n0) B) /\ (leq B (tptp_minus_1))) => ((a_select3 (q) (pv10) B) = (divide (sqrt (times (minus (a_select3 (center) B (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) B (n0)) (a_select2 (x) (pv10))))) (sum (n0) (n4) (sqrt (times (minus (a_select3 (center) (tptp_sum_index) (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) (tptp_sum_index) (n0)) (a_select2 (x) (pv10))))))))))) (All X, (-. (gt X X))) (gt (n1) (n0)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ((succ (n0)) = (n1)) ### NotAllEx 34
% 6.35/6.62 36. (-. (((leq (n0) (pv10)) /\ ((leq (pv10) (n135299)) /\ (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))))) => (All B, (((leq (n0) B) /\ (leq B (tptp_minus_1))) => ((a_select3 (q) (pv10) B) = (divide (sqrt (times (minus (a_select3 (center) B (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) B (n0)) (a_select2 (x) (pv10))))) (sum (n0) (n4) (sqrt (times (minus (a_select3 (center) (tptp_sum_index) (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) (tptp_sum_index) (n0)) (a_select2 (x) (pv10)))))))))))) ((succ (n0)) = (n1)) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (n0))) = (n2)) (All X, (((leq (n0) X) /\ (leq X (n1))) => ((X = (n0)) \/ (X = (n1))))) (gt (n1) (n0)) (All X, (-. (gt X X))) ### ConjTree 35
% 6.35/6.62 % SZS output end Proof
% 6.35/6.62 (* END-PROOF *)
%------------------------------------------------------------------------------