TSTP Solution File: SWV159+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWV159+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 : n010.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 12.84s 13.00s
% Output : Proof 12.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV159+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 04:00:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 12.84/13.00 % SZS status Theorem
% 12.84/13.00 (* PROOF-FOUND *)
% 12.84/13.00 (* BEGIN-PROOF *)
% 12.84/13.00 % SZS output start Proof
% 12.84/13.00 1. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0))) ### Axiom
% 12.84/13.00 2. (-. (leq (n0) T_0)) (gt (succ T_0) (n0)) ### Definition-Pseudo(leq) 1
% 12.84/13.00 3. (gt (succ (pred (pv10))) T_0) (-. (gt (succ (pred (pv10))) T_0)) ### Axiom
% 12.84/13.00 4. (-. (leq T_0 (pred (pv10)))) (gt (succ (pred (pv10))) T_0) ### Definition-Pseudo(leq) 3
% 12.84/13.00 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
% 12.84/13.00 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
% 12.84/13.00 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
% 12.84/13.00 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
% 12.84/13.00 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
% 12.84/13.00 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
% 12.84/13.00 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
% 12.84/13.00 12. (-. ((((pv84) = (sum (n0) (n4) (divide (times (exp (divide (divide (times (minus (a_select2 (x) (pv10)) (a_select2 (mu) (tptp_sum_index))) (minus (a_select2 (x) (pv10)) (a_select2 (mu) (tptp_sum_index)))) (tptp_minus_2)) (times (a_select2 (sigma) (tptp_sum_index)) (a_select2 (sigma) (tptp_sum_index))))) (a_select2 (rho) (tptp_sum_index))) (times (sqrt (times (n2) (tptp_pi))) (a_select2 (sigma) (tptp_sum_index)))))) /\ ((leq (n0) (pv10)) /\ ((leq (n0) (pv47)) /\ ((leq (pv10) (n135299)) /\ ((leq (pv47) (n4)) /\ ((All A, (((leq (n0) A) /\ (leq A (pred (pv47)))) => ((a_select3 (q) (pv10) A) = (divide (divide (times (exp (divide (divide (times (minus (a_select2 (x) (pv10)) (a_select2 (mu) A)) (minus (a_select2 (x) (pv10)) (a_select2 (mu) A))) (tptp_minus_2)) (times (a_select2 (sigma) A) (a_select2 (sigma) A)))) (a_select2 (rho) A)) (times (sqrt (times (n2) (tptp_pi))) (a_select2 (sigma) A))) (sum (n0) (n4) (divide (times (exp (divide (divide (times (minus (a_select2 (x) (pv10)) (a_select2 (mu) (tptp_sum_index))) (minus (a_select2 (x) (pv10)) (a_select2 (mu) (tptp_sum_index)))) (tptp_minus_2)) (times (a_select2 (sigma) (tptp_sum_index)) (a_select2 (sigma) (tptp_sum_index))))) (a_select2 (rho) (tptp_sum_index))) (times (sqrt (times (n2) (tptp_pi))) (a_select2 (sigma) (tptp_sum_index))))))))) /\ (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
% 12.84/13.00 % SZS output end Proof
% 12.84/13.00 (* END-PROOF *)
%------------------------------------------------------------------------------