TSTP Solution File: SWV155+1 by SuperZenon---0.0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWV155+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 : n027.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 10.05s 10.25s
% Output   : Proof 10.05s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV155+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.33  % Computer : n027.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 : Thu Jun 16 00:20:35 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 10.05/10.25  % SZS status Theorem
% 10.05/10.25  (* PROOF-FOUND *)
% 10.05/10.25  (* BEGIN-PROOF *)
% 10.05/10.25  % SZS output start Proof
% 10.05/10.25  1. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0)))   ### Axiom
% 10.05/10.25  2. (-. (leq (n0) T_0)) (gt (succ T_0) (n0))   ### Definition-Pseudo(leq) 1
% 10.05/10.25  3. (gt (succ (pred (pv10))) T_0) (-. (gt (succ (pred (pv10))) T_0))   ### Axiom
% 10.05/10.25  4. (-. (leq T_0 (pred (pv10)))) (gt (succ (pred (pv10))) T_0)   ### Definition-Pseudo(leq) 3
% 10.05/10.25  5. ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) = (n1))   ### Axiom
% 10.05/10.25  6. (((leq (n0) T_0) /\ (leq T_0 (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) = (n1))) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (gt (succ (pred (pv10))) T_0) (gt (succ T_0) (n0))   ### DisjTree 2 4 5
% 10.05/10.25  7. (All B, (((leq (n0) B) /\ (leq B (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) B (tptp_sum_index))) = (n1)))) (gt (succ T_0) (n0)) (gt (succ (pred (pv10))) T_0) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1))   ### All 6
% 10.05/10.25  8. (leq T_0 (pred (pv10))) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (gt (succ T_0) (n0)) (All B, (((leq (n0) B) /\ (leq B (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) B (tptp_sum_index))) = (n1))))   ### Definition-Pseudo(leq) 7
% 10.05/10.25  9. (leq (n0) T_0) (All B, (((leq (n0) B) /\ (leq B (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) B (tptp_sum_index))) = (n1)))) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (leq T_0 (pred (pv10)))   ### Definition-Pseudo(leq) 8
% 10.05/10.25  10. (-. (((leq (n0) T_0) /\ (leq T_0 (pred (pv10)))) => (((pv10) != T_0) => ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) = (n1))))) (All B, (((leq (n0) B) /\ (leq B (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) B (tptp_sum_index))) = (n1))))   ### ConjTree 9
% 10.05/10.25  11. (-. (All C, (((leq (n0) C) /\ (leq C (pred (pv10)))) => (((pv10) != C) => ((sum (n0) (n4) (a_select3 (q) C (tptp_sum_index))) = (n1)))))) (All B, (((leq (n0) B) /\ (leq B (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) B (tptp_sum_index))) = (n1))))   ### NotAllEx 10
% 10.05/10.25  12. (-. ((((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) (a_select3 (q) C (tptp_sum_index))) = (n1)))))))   ### ConjTree 11
% 10.05/10.25  % SZS output end Proof
% 10.05/10.25  (* END-PROOF *)
%------------------------------------------------------------------------------