%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWV151+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:10 EDT 2022 % Result : Theorem 8.25s 8.44s % Output : Proof 8.25s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWV151+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.13/0.34 % Computer : n022.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 15 10:54:33 EDT 2022 % 0.13/0.34 % CPUTime : % 8.25/8.44 % SZS status Theorem % 8.25/8.44 (* PROOF-FOUND *) % 8.25/8.44 (* BEGIN-PROOF *) % 8.25/8.44 % SZS output start Proof % 8.25/8.44 1. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0))) ### Axiom % 8.25/8.44 2. (-. (leq (n0) T_0)) (gt (succ T_0) (n0)) ### Definition-Pseudo(leq) 1 % 8.25/8.44 3. ((succ (succ (n0))) = (n2)) ((n2) != (succ (succ (n0)))) ### Sym(=) % 8.25/8.44 4. ((succ (n2)) != (succ (succ (succ (n0))))) ((succ (succ (n0))) = (n2)) ### NotEqual 3 % 8.25/8.44 5. ((n3) != (n3)) ### NotEqual % 8.25/8.44 6. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=) % 8.25/8.44 7. (-. (gt (n3) (succ (tptp_minus_1)))) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 5 6 % 8.25/8.44 8. (-. (gt (succ (n2)) (succ (tptp_minus_1)))) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) ### TransEq 4 7 7 % 8.25/8.44 9. (T_0 != T_0) ### Refl(=) % 8.25/8.44 10. (-. (gt (succ (n2)) T_0)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) ### Trans 8 9 % 8.25/8.44 11. (-. (leq T_0 (n2))) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) ### Definition-Pseudo(leq) 10 % 8.25/8.44 12. (T_0 != (n0)) (T_0 = (n0)) ### Axiom % 8.25/8.44 13. (T_0 != (n1)) (T_0 = (n1)) ### Axiom % 8.25/8.44 14. (T_0 != (n2)) (T_0 = (n2)) ### Axiom % 8.25/8.44 15. (((leq (n0) T_0) /\ (leq T_0 (n2))) => ((T_0 = (n0)) \/ ((T_0 = (n1)) \/ (T_0 = (n2))))) (T_0 != (n2)) (T_0 != (n1)) (T_0 != (n0)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) ### DisjTree 2 11 12 13 14 % 8.25/8.44 16. (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n0)) (T_0 != (n1)) (T_0 != (n2)) ### All 15 % 8.25/8.44 17. ((succ (tptp_minus_1)) = (n0)) ((succ (tptp_minus_1)) != (n0)) ### Axiom % 8.25/8.44 18. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=) % 8.25/8.44 19. (-. (gt (succ (tptp_minus_1)) (n0))) (T_0 != (n2)) (T_0 != (n1)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ### Trans 18 16 % 8.25/8.44 20. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=) % 8.25/8.44 21. (-. (gt (succ (tptp_minus_1)) (succ (tptp_minus_1)))) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n1)) (T_0 != (n2)) ((succ (tptp_minus_1)) = (n0)) ### TransEq2 17 19 20 % 8.25/8.44 22. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=) % 8.25/8.44 23. (-. (gt T_0 (succ (tptp_minus_1)))) (T_0 != (n2)) (T_0 != (n1)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ### TransEq2 16 21 22 % 8.25/8.44 24. ((succ (n0)) != (succ (n0))) ### Refl(=) % 8.25/8.44 25. ((n1) != (n1)) ### NotEqual % 8.25/8.44 26. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=) % 8.25/8.44 27. (-. (gt (n1) (succ (tptp_minus_1)))) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 25 26 % 8.25/8.44 28. (-. (gt (succ (n0)) (succ (tptp_minus_1)))) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) ### TransEq 24 27 27 % 8.25/8.44 29. (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n2)) (-. (gt T_0 (succ (tptp_minus_1)))) ### TransEq2 23 28 28 % 8.25/8.44 30. ((succ (succ (n0))) != (succ (succ (n0)))) ### Refl(=) % 8.25/8.44 31. ((n2) != (n2)) ### NotEqual % 8.25/8.44 32. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=) % 8.25/8.44 33. (-. (gt (n2) (succ (tptp_minus_1)))) (gt (n2) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 31 32 % 8.25/8.44 34. (-. (gt (succ (succ (n0))) (succ (tptp_minus_1)))) ((succ (succ (n0))) = (n2)) ((succ (tptp_minus_1)) = (n0)) (gt (n2) (n0)) ### TransEq 30 33 33 % 8.25/8.44 35. (gt (n2) (n0)) (-. (gt T_0 (succ (tptp_minus_1)))) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (n0)) = (n1)) (gt (n1) (n0)) ### TransEq2 29 34 34 % 8.25/8.44 36. (T_0 != T_0) ### Refl(=) % 8.25/8.44 37. (-. (gt T_0 T_0)) (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (succ (tptp_minus_1)) T_0) (gt (n2) (n0)) ### Trans 35 36 % 8.25/8.44 38. (All X, (-. (gt X X))) (gt (n2) (n0)) (gt (succ (tptp_minus_1)) T_0) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (n0)) = (n1)) (gt (n1) (n0)) ### All 37 % 8.25/8.44 39. (leq T_0 (tptp_minus_1)) (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) (gt (succ T_0) (n0)) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (n2) (n0)) (All X, (-. (gt X X))) ### Definition-Pseudo(leq) 38 % 8.25/8.44 40. (leq (n0) T_0) (All X, (-. (gt X X))) (gt (n2) (n0)) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (n0)) = (n1)) (gt (n1) (n0)) (leq T_0 (tptp_minus_1)) ### Definition-Pseudo(leq) 39 % 8.25/8.44 41. (-. (((leq (n0) T_0) /\ (leq T_0 (tptp_minus_1))) => ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) = (n1)))) (gt (n1) (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (succ (succ (n0)))) = (n3)) ((succ (tptp_minus_1)) = (n0)) (gt (n3) (n0)) ((succ (succ (n0))) = (n2)) (gt (n2) (n0)) (All X, (-. (gt X X))) ### ConjTree 40 % 8.25/8.44 42. (-. (All A, (((leq (n0) A) /\ (leq A (tptp_minus_1))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1))))) (All X, (-. (gt X X))) (gt (n2) (n0)) ((succ (succ (n0))) = (n2)) (gt (n3) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (succ (succ (n0)))) = (n3)) (All X, (((leq (n0) X) /\ (leq X (n2))) => ((X = (n0)) \/ ((X = (n1)) \/ (X = (n2)))))) ((succ (n0)) = (n1)) (gt (n1) (n0)) ### NotAllEx 41 % 8.25/8.44 % SZS output end Proof % 8.25/8.44 (* END-PROOF *) %------------------------------------------------------------------------------