TSTP Solution File: SWV156+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWV156+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 : n022.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:11 EDT 2022
% Result : Theorem 14.19s 14.37s
% Output : Proof 14.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV156+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 : n022.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 : Wed Jun 15 07:01:33 EDT 2022
% 0.14/0.36 % CPUTime :
% 14.19/14.37 % SZS status Theorem
% 14.19/14.37 (* PROOF-FOUND *)
% 14.19/14.37 (* BEGIN-PROOF *)
% 14.19/14.37 % SZS output start Proof
% 14.19/14.37 1. ((pv10) != (pv10)) ### NotEqual
% 14.19/14.37 2. (T_0 != T_0) ### Refl(=)
% 14.19/14.37 3. ((succ (pred T_0)) = T_0) (T_0 != (succ (pred T_0))) ### Sym(=)
% 14.19/14.37 4. (T_0 != T_0) ### Refl(=)
% 14.19/14.37 5. ((pv10) = T_0) (T_0 != (pv10)) ### Sym(=)
% 14.19/14.37 6. ((pred T_0) != (pred (pv10))) ((pv10) = T_0) ### NotEqual 5
% 14.19/14.37 7. ((succ (pred T_0)) != (succ (pred (pv10)))) ((pv10) = T_0) ### NotEqual 6
% 14.19/14.37 8. ((succ (pred T_0)) = T_0) (T_0 != (succ (pred T_0))) ### Sym(=)
% 14.19/14.37 9. (-. (gt (succ (pred T_0)) (succ (pred T_0)))) (gt (succ (pred (pv10))) T_0) ((succ (pred T_0)) = T_0) ((pv10) = T_0) ### Trans 7 8
% 14.19/14.37 10. ((succ (pred T_0)) != (succ (pred T_0))) ### Refl(=)
% 14.19/14.37 11. (-. (gt T_0 (succ (pred T_0)))) ((pv10) = T_0) ((succ (pred T_0)) = T_0) (gt (succ (pred (pv10))) T_0) ### TransEq2 4 9 10
% 14.19/14.37 12. (T_0 != T_0) ### Refl(=)
% 14.19/14.37 13. (-. (gt T_0 T_0)) (gt (succ (pred (pv10))) T_0) ((pv10) = T_0) ((succ (pred T_0)) = T_0) ### TransEq 3 11 12
% 14.19/14.37 14. (All X, ((succ (pred X)) = X)) ((pv10) = T_0) (gt (succ (pred (pv10))) T_0) (-. (gt T_0 T_0)) ### All 13
% 14.19/14.37 15. (-. (gt T_0 (pv10))) (gt (succ (pred (pv10))) T_0) ((pv10) = T_0) (All X, ((succ (pred X)) = X)) ### TransEq2 2 14 1
% 14.19/14.37 16. ((pv10) = T_0) (T_0 != (pv10)) ### Sym(=)
% 14.19/14.37 17. (-. (gt (pv10) (pv10))) (All X, ((succ (pred X)) = X)) ((pv10) = T_0) (gt (succ (pred (pv10))) T_0) ### TransEq 1 15 16
% 14.19/14.37 18. (All X, (-. (gt X X))) (gt (succ (pred (pv10))) T_0) ((pv10) = T_0) (All X, ((succ (pred X)) = X)) ### All 17
% 14.19/14.37 19. (leq T_0 (pred (pv10))) (All X, ((succ (pred X)) = X)) ((pv10) = T_0) (All X, (-. (gt X X))) ### Definition-Pseudo(leq) 18
% 14.19/14.37 20. (-. (((leq (n0) T_0) /\ (leq T_0 (pred (pv10)))) => (((pv10) = T_0) => ((sum (n0) (n4) (cond (tptp_term_equals (pv12) (tptp_sum_index)) (divide (sqrt (times (minus (a_select3 (center) (pv12) (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) (pv12) (n0)) (a_select2 (x) (pv10))))) (pv70)) (a_select3 (q) T_0 (tptp_sum_index)))) = (n1))))) (All X, (-. (gt X X))) (All X, ((succ (pred X)) = X)) ### ConjTree 19
% 14.19/14.37 21. (-. (All C, (((leq (n0) C) /\ (leq C (pred (pv10)))) => (((pv10) = C) => ((sum (n0) (n4) (cond (tptp_term_equals (pv12) (tptp_sum_index)) (divide (sqrt (times (minus (a_select3 (center) (pv12) (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) (pv12) (n0)) (a_select2 (x) (pv10))))) (pv70)) (a_select3 (q) C (tptp_sum_index)))) = (n1)))))) (All X, ((succ (pred X)) = X)) (All X, (-. (gt X X))) ### NotAllEx 20
% 14.19/14.37 22. (-. ((((pv70) = (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))))))) /\ ((leq (n0) (pv10)) /\ ((leq (n0) (pv12)) /\ ((leq (pv10) (n135299)) /\ ((leq (pv12) (n4)) /\ ((All A, (((leq (n0) A) /\ (leq A (pred (pv12)))) => ((a_select3 (q) (pv10) A) = (divide (sqrt (times (minus (a_select3 (center) A (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) A (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 B, (((leq (n0) B) /\ (leq B (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) B (tptp_sum_index))) = (n1)))))))))) => (All C, (((leq (n0) C) /\ (leq C (pred (pv10)))) => (((pv10) = C) => ((sum (n0) (n4) (cond (tptp_term_equals (pv12) (tptp_sum_index)) (divide (sqrt (times (minus (a_select3 (center) (pv12) (n0)) (a_select2 (x) (pv10))) (minus (a_select3 (center) (pv12) (n0)) (a_select2 (x) (pv10))))) (pv70)) (a_select3 (q) C (tptp_sum_index)))) = (n1))))))) (All X, (-. (gt X X))) (All X, ((succ (pred X)) = X)) ### ConjTree 21
% 14.19/14.37 % SZS output end Proof
% 14.19/14.37 (* END-PROOF *)
%------------------------------------------------------------------------------