%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : NUM405+1 : TPTP v8.1.0. Released v3.2.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 : Mon Jul 18 14:42:11 EDT 2022 % Result : Theorem 0.19s 0.47s % Output : Proof 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM405+1 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.12/0.34 % Computer : n026.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Wed Jul 6 12:43:38 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.47 % SZS status Theorem % 0.19/0.47 (* PROOF-FOUND *) % 0.19/0.47 (* BEGIN-PROOF *) % 0.19/0.47 % SZS output start Proof % 0.19/0.47 1. (ordinal T_0) (-. (ordinal T_0)) ### Axiom % 0.19/0.47 2. (-. (in T_0 T_1)) (in T_0 T_1) ### Axiom % 0.19/0.47 3. ((ordinal T_0) => (in T_0 T_1)) (-. (in T_0 T_1)) (ordinal T_0) ### Imply 1 2 % 0.19/0.47 4. (All B, ((ordinal B) => (in B T_1))) (ordinal T_0) (-. (in T_0 T_1)) ### All 3 % 0.19/0.47 5. (ordinal T_0) (-. (ordinal T_0)) ### Axiom % 0.19/0.47 6. (-. ((in T_0 T_1) /\ (ordinal T_0))) (ordinal T_0) (All B, ((ordinal B) => (in B T_1))) ### NotAnd 4 5 % 0.19/0.47 7. (-. (in T_0 T_2)) (in T_0 T_2) ### Axiom % 0.19/0.47 8. ((in T_0 T_2) <=> ((in T_0 T_1) /\ (ordinal T_0))) (-. (in T_0 T_2)) (All B, ((ordinal B) => (in B T_1))) (ordinal T_0) ### Equiv 6 7 % 0.19/0.47 9. (All C, ((in C T_2) <=> ((in C T_1) /\ (ordinal C)))) (ordinal T_0) (All B, ((ordinal B) => (in B T_1))) (-. (in T_0 T_2)) ### All 8 % 0.19/0.47 10. (in T_0 T_2) (-. (in T_0 T_2)) ### Axiom % 0.19/0.47 11. (-. (epsilon_transitive T_0)) (epsilon_transitive T_0) ### Axiom % 0.19/0.47 12. (ordinal T_0) (-. (epsilon_transitive T_0)) ### Extension/test/cc1_ordinal1 11 % 0.19/0.47 13. ((in T_0 T_1) /\ (ordinal T_0)) (-. (epsilon_transitive T_0)) ### And 12 % 0.19/0.47 14. ((in T_0 T_2) <=> ((in T_0 T_1) /\ (ordinal T_0))) (-. (epsilon_transitive T_0)) (in T_0 T_2) ### Equiv 10 13 % 0.19/0.47 15. (All C, ((in C T_2) <=> ((in C T_1) /\ (ordinal C)))) (in T_0 T_2) (-. (epsilon_transitive T_0)) ### All 14 % 0.19/0.47 16. (in T_0 T_2) (-. (in T_0 T_2)) ### Axiom % 0.19/0.47 17. (-. (epsilon_connected T_0)) (epsilon_connected T_0) ### Axiom % 0.19/0.47 18. (ordinal T_0) (-. (epsilon_connected T_0)) ### Extension/test/cc1_ordinal1 17 % 0.19/0.47 19. ((in T_0 T_1) /\ (ordinal T_0)) (-. (epsilon_connected T_0)) ### And 18 % 0.19/0.47 20. ((in T_0 T_2) <=> ((in T_0 T_1) /\ (ordinal T_0))) (-. (epsilon_connected T_0)) (in T_0 T_2) ### Equiv 16 19 % 0.19/0.47 21. (All C, ((in C T_2) <=> ((in C T_1) /\ (ordinal C)))) (in T_0 T_2) (-. (epsilon_connected T_0)) ### All 20 % 0.19/0.47 22. (-. (ordinal T_0)) (in T_0 T_2) (All C, ((in C T_2) <=> ((in C T_1) /\ (ordinal C)))) ### Extension/test/cc2_ordinal1ctrp 15 21 % 0.19/0.47 23. (-. ((in T_0 T_2) <=> (ordinal T_0))) (All B, ((ordinal B) => (in B T_1))) (All C, ((in C T_2) <=> ((in C T_1) /\ (ordinal C)))) ### NotEquiv 9 22 % 0.19/0.47 24. (-. (All B, ((in B T_2) <=> (ordinal B)))) (All C, ((in C T_2) <=> ((in C T_1) /\ (ordinal C)))) (All B, ((ordinal B) => (in B T_1))) ### NotAllEx 23 % 0.19/0.47 25. (All A, (-. (All B, ((in B A) <=> (ordinal B))))) (All B, ((ordinal B) => (in B T_1))) (All C, ((in C T_2) <=> ((in C T_1) /\ (ordinal C)))) ### All 24 % 0.19/0.47 26. (Ex B, (All C, ((in C B) <=> ((in C T_1) /\ (ordinal C))))) (All B, ((ordinal B) => (in B T_1))) (All A, (-. (All B, ((in B A) <=> (ordinal B))))) ### Exists 25 % 0.19/0.47 27. (All A, (Ex B, (All C, ((in C B) <=> ((in C A) /\ (ordinal C)))))) (All A, (-. (All B, ((in B A) <=> (ordinal B))))) (All B, ((ordinal B) => (in B T_1))) ### All 26 % 0.19/0.47 28. (-. (-. (All B, ((ordinal B) => (in B T_1))))) (All A, (-. (All B, ((in B A) <=> (ordinal B))))) (All A, (Ex B, (All C, ((in C B) <=> ((in C A) /\ (ordinal C)))))) ### NotNot 27 % 0.19/0.47 29. (-. (All A, (-. (All B, ((ordinal B) => (in B A)))))) (All A, (Ex B, (All C, ((in C B) <=> ((in C A) /\ (ordinal C)))))) (All A, (-. (All B, ((in B A) <=> (ordinal B))))) ### NotAllEx 28 % 0.19/0.47 % SZS output end Proof % 0.19/0.47 (* END-PROOF *) %------------------------------------------------------------------------------