%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWV162+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 : n013.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 25.39s 25.58s % Output : Proof 25.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV162+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.07/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.14/0.34 % Computer : n013.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Thu Jun 16 04:29:59 EDT 2022 % 0.14/0.34 % CPUTime : % 25.39/25.58 % SZS status Theorem % 25.39/25.58 (* PROOF-FOUND *) % 25.39/25.58 (* BEGIN-PROOF *) % 25.39/25.58 % SZS output start Proof % 25.39/25.58 1. ((n0) != (n0)) ### NotEqual % 25.39/25.58 2. ((n4) != (n4)) ### NotEqual % 25.39/25.58 3. ((q) != (q)) ### NotEqual % 25.39/25.58 4. (gt (succ T_0) (n0)) (-. (gt (succ T_0) (n0))) ### Axiom % 25.39/25.58 5. (-. (leq (n0) T_0)) (gt (succ T_0) (n0)) ### Definition-Pseudo(leq) 4 % 25.39/25.58 6. (gt (succ (pv10)) T_0) (-. (gt (succ (pv10)) T_0)) ### Axiom % 25.39/25.58 7. (-. (leq T_0 (pv10))) (gt (succ (pv10)) T_0) ### Definition-Pseudo(leq) 6 % 25.39/25.58 8. (T_0 != (pv10)) (T_0 = (pv10)) ### Axiom % 25.39/25.58 9. ((succ (pred (pv10))) != (pv10)) ((succ (pred (pv10))) = (pv10)) ### Axiom % 25.39/25.58 10. (All X, ((succ (pred X)) = X)) ((succ (pred (pv10))) != (pv10)) ### All 9 % 25.39/25.58 11. (T_0 != T_0) ### Refl(=) % 25.39/25.58 12. (-. (gt (succ (pred (pv10))) T_0)) (gt (pv10) T_0) (All X, ((succ (pred X)) = X)) ### Trans 10 11 % 25.39/25.58 13. (((leq T_0 (pv10)) /\ (T_0 != (pv10))) => (gt (pv10) T_0)) (All X, ((succ (pred X)) = X)) (-. (gt (succ (pred (pv10))) T_0)) (T_0 != (pv10)) (gt (succ (pv10)) T_0) ### DisjTree 7 8 12 % 25.39/25.58 14. (All Y, (((leq T_0 Y) /\ (T_0 != Y)) => (gt Y T_0))) (gt (succ (pv10)) T_0) (T_0 != (pv10)) (-. (gt (succ (pred (pv10))) T_0)) (All X, ((succ (pred X)) = X)) ### All 13 % 25.39/25.58 15. (-. (leq T_0 (pred (pv10)))) (All X, ((succ (pred X)) = X)) (T_0 != (pv10)) (gt (succ (pv10)) T_0) (All Y, (((leq T_0 Y) /\ (T_0 != Y)) => (gt Y T_0))) ### Definition-Pseudo(leq) 14 % 25.39/25.58 16. ((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 % 25.39/25.58 17. (((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)) (All Y, (((leq T_0 Y) /\ (T_0 != Y)) => (gt Y T_0))) (gt (succ (pv10)) T_0) (T_0 != (pv10)) (All X, ((succ (pred X)) = X)) (gt (succ T_0) (n0)) ### DisjTree 5 15 16 % 25.39/25.58 18. (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) (gt (succ T_0) (n0)) (All X, ((succ (pred X)) = X)) (T_0 != (pv10)) (gt (succ (pv10)) T_0) (All Y, (((leq T_0 Y) /\ (T_0 != Y)) => (gt Y T_0))) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) ### All 17 % 25.39/25.58 19. (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (gt (succ (pv10)) T_0) (T_0 != (pv10)) (All X, ((succ (pred X)) = X)) (gt (succ T_0) (n0)) (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) ### All 18 % 25.39/25.58 20. ((tptp_sum_index) != (tptp_sum_index)) ### NotEqual % 25.39/25.58 21. ((a_select3 (q) T_0 (tptp_sum_index)) != (a_select3 (q) (pv10) (tptp_sum_index))) (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) (gt (succ T_0) (n0)) (All X, ((succ (pred X)) = X)) (gt (succ (pv10)) T_0) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ### NotEqual 3 19 20 % 25.39/25.58 22. ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (sum (n0) (n4) (a_select3 (q) (pv10) (tptp_sum_index)))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (gt (succ (pv10)) T_0) (All X, ((succ (pred X)) = X)) (gt (succ T_0) (n0)) (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) ### NotEqual 1 2 21 % 25.39/25.58 23. ((n1) != (n1)) ### NotEqual % 25.39/25.58 24. ((sum (n0) (n4) (a_select3 (q) (pv10) (tptp_sum_index))) = (n1)) (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) (gt (succ T_0) (n0)) (All X, ((succ (pred X)) = X)) (gt (succ (pv10)) T_0) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ### Trans 22 23 % 25.39/25.58 25. (leq T_0 (pv10)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (All X, ((succ (pred X)) = X)) (gt (succ T_0) (n0)) (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) ((sum (n0) (n4) (a_select3 (q) (pv10) (tptp_sum_index))) = (n1)) ### Definition-Pseudo(leq) 24 % 25.39/25.58 26. (leq (n0) T_0) ((sum (n0) (n4) (a_select3 (q) (pv10) (tptp_sum_index))) = (n1)) (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) (All X, ((succ (pred X)) = X)) ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) != (n1)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (leq T_0 (pv10)) ### Definition-Pseudo(leq) 25 % 25.39/25.58 27. (-. (((leq (n0) T_0) /\ (leq T_0 (pv10))) => ((sum (n0) (n4) (a_select3 (q) T_0 (tptp_sum_index))) = (n1)))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (All X, ((succ (pred X)) = X)) (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) ((sum (n0) (n4) (a_select3 (q) (pv10) (tptp_sum_index))) = (n1)) ### ConjTree 26 % 25.39/25.58 28. (-. (All B, (((leq (n0) B) /\ (leq B (pv10))) => ((sum (n0) (n4) (a_select3 (q) B (tptp_sum_index))) = (n1))))) ((sum (n0) (n4) (a_select3 (q) (pv10) (tptp_sum_index))) = (n1)) (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1)))) (All X, ((succ (pred X)) = X)) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) ### NotAllEx 27 % 25.39/25.58 29. (-. ((((sum (n0) (n4) (a_select3 (q) (pv10) (tptp_sum_index))) = (n1)) /\ ((leq (n0) (pv10)) /\ ((leq (pv10) (n135299)) /\ (All A, (((leq (n0) A) /\ (leq A (pred (pv10)))) => ((sum (n0) (n4) (a_select3 (q) A (tptp_sum_index))) = (n1))))))) => (All B, (((leq (n0) B) /\ (leq B (pv10))) => ((sum (n0) (n4) (a_select3 (q) B (tptp_sum_index))) = (n1)))))) (All X, (All Y, (((leq X Y) /\ (X != Y)) => (gt Y X)))) (All X, ((succ (pred X)) = X)) ### ConjTree 28 % 25.39/25.58 % SZS output end Proof % 25.39/25.58 (* END-PROOF *) %------------------------------------------------------------------------------