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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWV038+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:49:48 EDT 2022

% Result   : Theorem 2.48s 2.63s
% Output   : Proof 2.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV038+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.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 : Wed Jun 15 21:16:49 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 2.48/2.63  % SZS status Theorem
% 2.48/2.63  (* PROOF-FOUND *)
% 2.48/2.63  (* BEGIN-PROOF *)
% 2.48/2.63  % SZS output start Proof
% 2.48/2.63  1. ((init) != (init))   ### NotEqual
% 2.48/2.63  2. ((s_best7_init) = (init)) ((s_best7_init) != (init))   ### Axiom
% 2.48/2.63  3. ((s_sworst7_init) = (init)) ((s_sworst7_init) != (init))   ### Axiom
% 2.48/2.63  4. ((s_worst7_init) = (init)) ((s_worst7_init) != (init))   ### Axiom
% 2.48/2.63  5. (gt (succ (s_best7)) (n0)) (-. (gt (succ (s_best7)) (n0)))   ### Axiom
% 2.48/2.63  6. (-. (leq (n0) (s_best7))) (gt (succ (s_best7)) (n0))   ### Definition-Pseudo(leq) 5
% 2.48/2.63  7. (gt (succ (s_sworst7)) (n0)) (-. (gt (succ (s_sworst7)) (n0)))   ### Axiom
% 2.48/2.63  8. (-. (leq (n0) (s_sworst7))) (gt (succ (s_sworst7)) (n0))   ### Definition-Pseudo(leq) 7
% 2.48/2.63  9. (gt (succ (s_worst7)) (n0)) (-. (gt (succ (s_worst7)) (n0)))   ### Axiom
% 2.48/2.63  10. (-. (leq (n0) (s_worst7))) (gt (succ (s_worst7)) (n0))   ### Definition-Pseudo(leq) 9
% 2.48/2.63  11. (gt (succ (n3)) (s_best7)) (-. (gt (succ (n3)) (s_best7)))   ### Axiom
% 2.48/2.63  12. (-. (leq (s_best7) (n3))) (gt (succ (n3)) (s_best7))   ### Definition-Pseudo(leq) 11
% 2.48/2.63  13. (gt (succ (n3)) (s_sworst7)) (-. (gt (succ (n3)) (s_sworst7)))   ### Axiom
% 2.48/2.63  14. (-. (leq (s_sworst7) (n3))) (gt (succ (n3)) (s_sworst7))   ### Definition-Pseudo(leq) 13
% 2.48/2.63  15. (gt (succ (n3)) (s_worst7)) (-. (gt (succ (n3)) (s_worst7)))   ### Axiom
% 2.48/2.63  16. (-. (leq (s_worst7) (n3))) (gt (succ (n3)) (s_worst7))   ### Definition-Pseudo(leq) 15
% 2.48/2.63  17. (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (-. (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))))   ### Axiom
% 2.48/2.63  18. (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (-. (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))))   ### Axiom
% 2.48/2.63  19. (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (-. (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))))   ### Axiom
% 2.48/2.63  20. (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (-. (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))))   ### Axiom
% 2.48/2.63  21. (-. (gt (loopcounter) (n1))) (gt (loopcounter) (n1))   ### Axiom
% 2.48/2.63  22. (-. ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))) (-. (gt (loopcounter) (n1)))   ### NotImply 21
% 2.48/2.63  23. (-. (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) (-. (gt (loopcounter) (n1))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (gt (succ (n3)) (s_worst7)) (gt (succ (n3)) (s_sworst7)) (gt (succ (n3)) (s_best7)) (gt (succ (s_worst7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_best7)) (n0)) ((s_worst7_init) = (init)) ((s_sworst7_init) = (init)) ((s_best7_init) = (init))   ### DisjTree 1 2 3 4 6 8 10 12 14 16 17 18 19 20 22
% 2.48/2.63  24. (-. (((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))))))))))))))))))) ((s_best7_init) = (init)) ((s_sworst7_init) = (init)) ((s_worst7_init) = (init)) (gt (succ (s_best7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_worst7)) (n0)) (gt (succ (n3)) (s_best7)) (gt (succ (n3)) (s_sworst7)) (gt (succ (n3)) (s_worst7)) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (-. (gt (loopcounter) (n1)))   ### NotImply 23
% 2.48/2.63  25. (-. (true)) (true)   ### P-NotP
% 2.48/2.63  26. (-. (((n0) = (pv1413)) => (true))) (true)   ### NotImply 25
% 2.48/2.63  27. (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true))))) (true) (-. (gt (loopcounter) (n1))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (gt (succ (n3)) (s_worst7)) (gt (succ (n3)) (s_sworst7)) (gt (succ (n3)) (s_best7)) (gt (succ (s_worst7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_best7)) (n0)) ((s_worst7_init) = (init)) ((s_sworst7_init) = (init)) ((s_best7_init) = (init))   ### DisjTree 1 24 26
% 2.48/2.63  28. ((s_best7_init) = (init)) ((s_best7_init) != (init))   ### Axiom
% 2.48/2.63  29. ((s_sworst7_init) = (init)) ((s_sworst7_init) != (init))   ### Axiom
% 2.48/2.63  30. ((s_worst7_init) = (init)) ((s_worst7_init) != (init))   ### Axiom
% 2.48/2.63  31. (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (-. (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))))   ### Axiom
% 2.48/2.63  32. (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (-. (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))))   ### Axiom
% 2.48/2.63  33. (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (-. (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))))   ### Axiom
% 2.48/2.63  34. (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (-. (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))))   ### Axiom
% 2.48/2.63  35. (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))) (-. (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))   ### Axiom
% 2.48/2.63  36. (-. ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))) (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))   ### NotImply 35
% 2.48/2.63  37. (-. (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (gt (succ (n3)) (s_worst7)) (gt (succ (n3)) (s_sworst7)) (gt (succ (n3)) (s_best7)) (gt (succ (s_worst7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_best7)) (n0)) ((s_worst7_init) = (init)) ((s_sworst7_init) = (init)) ((s_best7_init) = (init))   ### DisjTree 1 28 29 30 6 8 10 12 14 16 31 32 33 34 36
% 2.48/2.63  38. (-. (((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))))))))))))))))))) ((s_best7_init) = (init)) ((s_sworst7_init) = (init)) ((s_worst7_init) = (init)) (gt (succ (s_best7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_worst7)) (n0)) (gt (succ (n3)) (s_best7)) (gt (succ (n3)) (s_sworst7)) (gt (succ (n3)) (s_worst7)) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))   ### NotImply 37
% 2.48/2.63  39. (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true))))) (true) (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (gt (succ (n3)) (s_worst7)) (gt (succ (n3)) (s_sworst7)) (gt (succ (n3)) (s_best7)) (gt (succ (s_worst7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_best7)) (n0)) ((s_worst7_init) = (init)) ((s_sworst7_init) = (init)) ((s_best7_init) = (init))   ### DisjTree 1 38 26
% 2.48/2.63  40. ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))) ((s_best7_init) = (init)) ((s_sworst7_init) = (init)) ((s_worst7_init) = (init)) (gt (succ (s_best7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_worst7)) (n0)) (gt (succ (n3)) (s_best7)) (gt (succ (n3)) (s_sworst7)) (gt (succ (n3)) (s_worst7)) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (true) (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true)))))   ### Imply 27 39
% 2.48/2.63  41. (leq (s_worst7) (n3)) (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true))))) (true) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (gt (succ (n3)) (s_sworst7)) (gt (succ (n3)) (s_best7)) (gt (succ (s_worst7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_best7)) (n0)) ((s_worst7_init) = (init)) ((s_sworst7_init) = (init)) ((s_best7_init) = (init)) ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))   ### Definition-Pseudo(leq) 40
% 2.48/2.63  42. (leq (s_sworst7) (n3)) ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))) ((s_best7_init) = (init)) ((s_sworst7_init) = (init)) ((s_worst7_init) = (init)) (gt (succ (s_best7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_worst7)) (n0)) (gt (succ (n3)) (s_best7)) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (true) (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true))))) (leq (s_worst7) (n3))   ### Definition-Pseudo(leq) 41
% 2.48/2.63  43. (leq (s_best7) (n3)) (leq (s_worst7) (n3)) (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true))))) (true) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (gt (succ (s_worst7)) (n0)) (gt (succ (s_sworst7)) (n0)) (gt (succ (s_best7)) (n0)) ((s_worst7_init) = (init)) ((s_sworst7_init) = (init)) ((s_best7_init) = (init)) ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))) (leq (s_sworst7) (n3))   ### Definition-Pseudo(leq) 42
% 2.48/2.63  44. (leq (n0) (s_worst7)) (leq (s_sworst7) (n3)) ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))) ((s_best7_init) = (init)) ((s_sworst7_init) = (init)) ((s_worst7_init) = (init)) (gt (succ (s_best7)) (n0)) (gt (succ (s_sworst7)) (n0)) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (true) (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true))))) (leq (s_worst7) (n3)) (leq (s_best7) (n3))   ### Definition-Pseudo(leq) 43
% 2.48/2.63  45. (leq (n0) (s_sworst7)) (leq (s_best7) (n3)) (leq (s_worst7) (n3)) (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true))))) (true) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (gt (succ (s_best7)) (n0)) ((s_worst7_init) = (init)) ((s_sworst7_init) = (init)) ((s_best7_init) = (init)) ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))) (leq (s_sworst7) (n3)) (leq (n0) (s_worst7))   ### Definition-Pseudo(leq) 44
% 2.48/2.63  46. (leq (n0) (s_best7)) (leq (n0) (s_worst7)) (leq (s_sworst7) (n3)) ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init))))) ((s_best7_init) = (init)) ((s_sworst7_init) = (init)) ((s_worst7_init) = (init)) (All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) (All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) (All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) (All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) (true) (-. (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true))))) (leq (s_worst7) (n3)) (leq (s_best7) (n3)) (leq (n0) (s_sworst7))   ### Definition-Pseudo(leq) 45
% 2.48/2.64  47. (-. ((((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))) => (((init) = (init)) /\ ((((n0) != (pv1413)) => (((init) = (init)) /\ (((s_best7_init) = (init)) /\ (((s_sworst7_init) = (init)) /\ (((s_worst7_init) = (init)) /\ ((leq (n0) (s_best7)) /\ ((leq (n0) (s_sworst7)) /\ ((leq (n0) (s_worst7)) /\ ((leq (s_best7) (n3)) /\ ((leq (s_sworst7) (n3)) /\ ((leq (s_worst7) (n3)) /\ ((All A, (((leq (n0) A) /\ (leq A (n2))) => (All B, (((leq (n0) B) /\ (leq B (n3))) => ((a_select3 (simplex7_init) B A) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n3))) => ((a_select2 (s_values7_init) C) = (init)))) /\ ((All D, (((leq (n0) D) /\ (leq D (n2))) => ((a_select2 (s_center7_init) D) = (init)))) /\ ((All E, (((leq (n0) E) /\ (leq E (minus (n3) (n1)))) => ((a_select2 (s_try7_init) E) = (init)))) /\ ((gt (loopcounter) (n1)) => (((pvar1400_init) = (init)) /\ (((pvar1401_init) = (init)) /\ ((pvar1402_init) = (init)))))))))))))))))))) /\ (((n0) = (pv1413)) => (true)))))) (true)   ### ConjTree 46
% 2.48/2.64  % SZS output end Proof
% 2.48/2.64  (* END-PROOF *)
%------------------------------------------------------------------------------