%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWV189+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 : n026.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:17 EDT 2022 % Result : Theorem 4.76s 5.02s % Output : Proof 4.76s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV189+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.34 % Computer : n026.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 17:24:22 EDT 2022 % 0.13/0.34 % CPUTime : % 4.76/5.02 % SZS status Theorem % 4.76/5.02 (* PROOF-FOUND *) % 4.76/5.02 (* BEGIN-PROOF *) % 4.76/5.02 % SZS output start Proof % 4.76/5.02 1. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0))) ### Axiom % 4.76/5.02 2. (-. (leq (n0) T_0)) (gt (succ T_0) (n0)) ### Definition-Pseudo(leq) 1 % 4.76/5.02 3. ((succ (n0)) != (succ (n0))) ### Refl(=) % 4.76/5.02 4. ((n1) != (n1)) ### NotEqual % 4.76/5.02 5. ((succ (tptp_minus_1)) = (n0)) ((n0) != (succ (tptp_minus_1))) ### Sym(=) % 4.76/5.02 6. (-. (gt (n1) (succ (tptp_minus_1)))) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ### Trans 4 5 % 4.76/5.02 7. (-. (gt (succ (n0)) (succ (tptp_minus_1)))) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) ### TransEq 3 6 6 % 4.76/5.02 8. (T_0 != T_0) ### Refl(=) % 4.76/5.02 9. (-. (gt (succ (n0)) T_0)) (gt (succ (tptp_minus_1)) T_0) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (n0)) = (n1)) ### Trans 7 8 % 4.76/5.02 10. (-. (leq T_0 (n0))) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) (gt (succ (tptp_minus_1)) T_0) ### Definition-Pseudo(leq) 9 % 4.76/5.02 11. (T_0 != (n0)) (T_0 = (n0)) ### Axiom % 4.76/5.02 12. (((leq (n0) T_0) /\ (leq T_0 (n0))) => (T_0 = (n0))) (T_0 != (n0)) (gt (succ (tptp_minus_1)) T_0) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (n0)) = (n1)) (gt (succ T_0) (n0)) ### DisjTree 2 10 11 % 4.76/5.02 13. (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) (gt (succ T_0) (n0)) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) (gt (succ (tptp_minus_1)) T_0) (T_0 != (n0)) ### All 12 % 4.76/5.02 14. ((succ (tptp_minus_1)) = (n0)) ((succ (tptp_minus_1)) != (n0)) ### Axiom % 4.76/5.02 15. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=) % 4.76/5.02 16. (-. (gt (succ (tptp_minus_1)) (n0))) (gt (succ (tptp_minus_1)) T_0) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (n0)) = (n1)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) ### Trans 15 13 % 4.76/5.02 17. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=) % 4.76/5.02 18. (-. (gt (succ (tptp_minus_1)) (succ (tptp_minus_1)))) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) (gt (succ T_0) (n0)) ((succ (n0)) = (n1)) (gt (n1) (n0)) (gt (succ (tptp_minus_1)) T_0) ((succ (tptp_minus_1)) = (n0)) ### TransEq2 14 16 17 % 4.76/5.02 19. ((succ (tptp_minus_1)) != (succ (tptp_minus_1))) ### Refl(=) % 4.76/5.02 20. (-. (gt T_0 (succ (tptp_minus_1)))) (gt (succ (tptp_minus_1)) T_0) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (n0)) = (n1)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) ### TransEq2 13 18 19 % 4.76/5.02 21. (T_0 != T_0) ### Refl(=) % 4.76/5.02 22. (-. (gt T_0 T_0)) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) (gt (succ T_0) (n0)) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) (gt (succ (tptp_minus_1)) T_0) ### Trans 20 21 % 4.76/5.02 23. (All X, (-. (gt X X))) (gt (succ (tptp_minus_1)) T_0) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (n0)) = (n1)) (gt (succ T_0) (n0)) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) ### All 22 % 4.76/5.02 24. (leq T_0 (tptp_minus_1)) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) (gt (succ T_0) (n0)) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) (All X, (-. (gt X X))) ### Definition-Pseudo(leq) 23 % 4.76/5.02 25. (leq (n0) T_0) (All X, (-. (gt X X))) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) (leq T_0 (tptp_minus_1)) ### Definition-Pseudo(leq) 24 % 4.76/5.02 26. (-. (((leq (n0) T_0) /\ (leq T_0 (tptp_minus_1))) => (All C, (((leq (n0) C) /\ (leq C (n4))) => ((a_select3 (q_init) T_0 C) = (init)))))) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) (All X, (-. (gt X X))) ### ConjTree 25 % 4.76/5.02 27. (-. (All B, (((leq (n0) B) /\ (leq B (tptp_minus_1))) => (All C, (((leq (n0) C) /\ (leq C (n4))) => ((a_select3 (q_init) B C) = (init))))))) (All X, (-. (gt X X))) (gt (n1) (n0)) ((succ (tptp_minus_1)) = (n0)) ((succ (n0)) = (n1)) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) ### NotAllEx 26 % 4.76/5.02 28. (-. ((All A, (((leq (n0) A) /\ (leq A (n4))) => ((a_select3 (center_init) A (n0)) = (init)))) => (All B, (((leq (n0) B) /\ (leq B (tptp_minus_1))) => (All C, (((leq (n0) C) /\ (leq C (n4))) => ((a_select3 (q_init) B C) = (init)))))))) (All X, (((leq (n0) X) /\ (leq X (n0))) => (X = (n0)))) ((succ (n0)) = (n1)) ((succ (tptp_minus_1)) = (n0)) (gt (n1) (n0)) (All X, (-. (gt X X))) ### NotImply 27 % 4.76/5.02 % SZS output end Proof % 4.76/5.02 (* END-PROOF *) %------------------------------------------------------------------------------