TSTP Solution File: SWV191+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWV191+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 : n020.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:18 EDT 2022
% Result : Theorem 7.77s 7.99s
% Output : Proof 7.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV191+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 10:07:04 EDT 2022
% 0.14/0.35 % CPUTime :
% 7.77/7.99 % SZS status Theorem
% 7.77/7.99 (* PROOF-FOUND *)
% 7.77/7.99 (* BEGIN-PROOF *)
% 7.77/7.99 % SZS output start Proof
% 7.77/7.99 1. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0))) ### Axiom
% 7.77/7.99 2. (-. (leq (n0) T_0)) (gt (succ T_0) (n0)) ### Definition-Pseudo(leq) 1
% 7.77/7.99 3. ((succ (n0)) = (n1)) ((n1) != (succ (n0))) ### Sym(=)
% 7.77/7.99 4. ((succ (n1)) != (succ (succ (n0)))) ((succ (n0)) = (n1)) ### NotEqual 3
% 7.77/7.99 5. ((n2) != (n2)) ### NotEqual
% 7.77/7.99 6. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=)
% 7.77/7.99 7. (-. (gt (n2) (succ (tptp_minus_1)))) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 5 6
% 7.77/7.99 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
% 7.77/7.99 9. (T_0 != T_0) ### Refl(=)
% 7.77/7.99 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
% 7.77/7.99 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
% 7.77/7.99 12. (T_0 != (n0)) (T_0 = (n0)) ### Axiom
% 7.77/7.99 13. (T_0 != (n1)) (T_0 = (n1)) ### Axiom
% 7.77/7.99 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
% 7.77/7.99 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
% 7.77/7.99 16. ((succ (tptp_minus_1)) = (n0)) ((succ (tptp_minus_1)) != (n0)) ### Axiom
% 7.77/7.99 17. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 7.77/7.99 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
% 7.77/7.99 19. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 7.77/7.99 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
% 7.77/7.99 21. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=)
% 7.77/7.99 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
% 7.77/7.99 23. ((succ (n0)) != (succ (n0))) ### Refl(=)
% 7.77/7.99 24. ((n1) != (n1)) ### NotEqual
% 7.77/7.99 25. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=)
% 7.77/7.99 26. (-. (gt (n1) (succ (tptp_minus_1)))) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 24 25
% 7.77/7.99 27. (-. (gt (succ (n0)) (succ (tptp_minus_1)))) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) ### TransEq 23 26 26
% 7.77/7.99 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
% 7.77/7.99 29. (T_0 != T_0) ### Refl(=)
% 7.77/7.99 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
% 7.77/7.99 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
% 7.77/7.99 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
% 7.77/7.99 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
% 7.77/7.99 34. (-. (((leq (n0) T_1) /\ ((leq (n0) T_0) /\ ((leq T_1 (n2)) /\ (leq T_0 (tptp_minus_1))))) => ((a_select3 (z_defuse) T_1 T_0) = (use)))) ((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
% 7.77/7.99 35. (-. (All B, (((leq (n0) T_1) /\ ((leq (n0) B) /\ ((leq T_1 (n2)) /\ (leq B (tptp_minus_1))))) => ((a_select3 (z_defuse) T_1 B) = (use))))) (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
% 7.77/7.99 36. (-. (All A, (All B, (((leq (n0) A) /\ ((leq (n0) B) /\ ((leq A (n2)) /\ (leq B (tptp_minus_1))))) => ((a_select3 (z_defuse) A B) = (use)))))) ((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))) ### NotAllEx 35
% 7.77/7.99 37. (-. ((((a_select2 (rho_defuse) (n0)) = (use)) /\ (((a_select2 (rho_defuse) (n1)) = (use)) /\ (((a_select2 (rho_defuse) (n2)) = (use)) /\ (((a_select2 (sigma_defuse) (n0)) = (use)) /\ (((a_select2 (sigma_defuse) (n1)) = (use)) /\ (((a_select2 (sigma_defuse) (n2)) = (use)) /\ (((a_select2 (sigma_defuse) (n3)) = (use)) /\ (((a_select2 (sigma_defuse) (n4)) = (use)) /\ (((a_select2 (sigma_defuse) (n5)) = (use)) /\ (((a_select3 (u_defuse) (n0) (n0)) = (use)) /\ (((a_select3 (u_defuse) (n1) (n0)) = (use)) /\ (((a_select3 (u_defuse) (n2) (n0)) = (use)) /\ (((a_select2 (xinit_defuse) (n3)) = (use)) /\ (((a_select2 (xinit_defuse) (n4)) = (use)) /\ (((a_select2 (xinit_defuse) (n5)) = (use)) /\ (((a_select2 (xinit_mean_defuse) (n0)) = (use)) /\ (((a_select2 (xinit_mean_defuse) (n1)) = (use)) /\ (((a_select2 (xinit_mean_defuse) (n2)) = (use)) /\ (((a_select2 (xinit_mean_defuse) (n3)) = (use)) /\ (((a_select2 (xinit_mean_defuse) (n4)) = (use)) /\ (((a_select2 (xinit_mean_defuse) (n5)) = (use)) /\ (((a_select2 (xinit_noise_defuse) (n0)) = (use)) /\ (((a_select2 (xinit_noise_defuse) (n1)) = (use)) /\ (((a_select2 (xinit_noise_defuse) (n2)) = (use)) /\ (((a_select2 (xinit_noise_defuse) (n3)) = (use)) /\ (((a_select2 (xinit_noise_defuse) (n4)) = (use)) /\ ((a_select2 (xinit_noise_defuse) (n5)) = (use)))))))))))))))))))))))))))) => (All A, (All B, (((leq (n0) A) /\ ((leq (n0) B) /\ ((leq A (n2)) /\ (leq B (tptp_minus_1))))) => ((a_select3 (z_defuse) A B) = (use))))))) (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)) ### ConjTree 36
% 7.77/7.99 % SZS output end Proof
% 7.77/7.99 (* END-PROOF *)
%------------------------------------------------------------------------------