%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SET988+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 : n008.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 : Tue Jul 19 05:45:26 EDT 2022 % Result : Theorem 2.76s 2.99s % Output : Proof 2.76s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET988+1 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.12/0.33 % Computer : n008.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 15:09:38 EDT 2022 % 0.12/0.33 % CPUTime : % 2.76/2.99 % SZS status Theorem % 2.76/2.99 (* PROOF-FOUND *) % 2.76/2.99 (* BEGIN-PROOF *) % 2.76/2.99 % SZS output start Proof % 2.76/2.99 1. (in T_0 T_1) (-. (in T_0 T_1)) ### Axiom % 2.76/2.99 2. ((unordered_pair (unordered_pair T_2 T_3) (singleton T_2)) = T_0) (T_0 != (unordered_pair (unordered_pair T_2 T_3) (singleton T_2))) ### Sym(=) % 2.76/2.99 3. (T_0 != (ordered_pair T_2 T_3)) ((unordered_pair (unordered_pair T_2 T_3) (singleton T_2)) = T_0) ### Definition-Pseudo(ordered_pair) 2 % 2.76/2.99 4. (All D, (T_0 != (ordered_pair T_2 D))) ((unordered_pair (unordered_pair T_2 T_3) (singleton T_2)) = T_0) ### All 3 % 2.76/2.99 5. (All C, (All D, (T_0 != (ordered_pair C D)))) ((unordered_pair (unordered_pair T_2 T_3) (singleton T_2)) = T_0) ### All 4 % 2.76/2.99 6. ((ordered_pair T_2 T_3) = T_0) (All C, (All D, (T_0 != (ordered_pair C D)))) ### Definition-Pseudo(ordered_pair) 5 % 2.76/2.99 7. (-. ((ordered_pair T_2 T_3) != T_0)) (All C, (All D, (T_0 != (ordered_pair C D)))) ### NotNot 6 % 2.76/2.99 8. (-. (All D, ((ordered_pair T_2 D) != T_0))) (All C, (All D, (T_0 != (ordered_pair C D)))) ### NotAllEx 7 % 2.76/2.99 9. (-. (All C, (All D, ((ordered_pair C D) != T_0)))) (All C, (All D, (T_0 != (ordered_pair C D)))) ### NotAllEx 8 % 2.76/2.99 10. (-. ((in T_0 T_1) /\ (All C, (All D, ((ordered_pair C D) != T_0))))) (All C, (All D, (T_0 != (ordered_pair C D)))) (in T_0 T_1) ### NotAnd 1 9 % 2.76/2.99 11. (All B, (-. ((in B T_1) /\ (All C, (All D, ((ordered_pair C D) != B)))))) (in T_0 T_1) (All C, (All D, (T_0 != (ordered_pair C D)))) ### All 10 % 2.76/2.99 12. ((in T_0 T_1) /\ (All C, (All D, (T_0 != (ordered_pair C D))))) (All B, (-. ((in B T_1) /\ (All C, (All D, ((ordered_pair C D) != B)))))) ### And 11 % 2.76/2.99 13. (-. (-. ((in T_0 T_1) /\ (All C, (All D, (T_0 != (ordered_pair C D))))))) (All B, (-. ((in B T_1) /\ (All C, (All D, ((ordered_pair C D) != B)))))) ### NotNot 12 % 2.76/2.99 14. (-. (All B, (-. ((in B T_1) /\ (All C, (All D, (B != (ordered_pair C D)))))))) (All B, (-. ((in B T_1) /\ (All C, (All D, ((ordered_pair C D) != B)))))) ### NotAllEx 13 % 2.76/2.99 15. (-. (relation T_1)) (All B, (-. ((in B T_1) /\ (All C, (All D, ((ordered_pair C D) != B)))))) ### Definition-Pseudo(relation) 14 % 2.76/2.99 16. (All B, (All C, (All D, (((in (ordered_pair B C) T_1) /\ (in (ordered_pair B D) T_1)) => (C = D))))) (-. (All B, (All C, (All D, (((in (ordered_pair B C) T_1) /\ (in (ordered_pair B D) T_1)) => (C = D)))))) ### Axiom % 2.76/2.99 17. (-. (function T_1)) (All B, (All C, (All D, (((in (ordered_pair B C) T_1) /\ (in (ordered_pair B D) T_1)) => (C = D))))) ### Definition-Pseudo(function) 16 % 2.76/2.99 18. (-. ((relation T_1) /\ (function T_1))) (All B, (All C, (All D, (((in (ordered_pair B C) T_1) /\ (in (ordered_pair B D) T_1)) => (C = D))))) (All B, (-. ((in B T_1) /\ (All C, (All D, ((ordered_pair C D) != B)))))) ### NotAnd 15 17 % 2.76/2.99 19. (-. (((All B, (-. ((in B T_1) /\ (All C, (All D, ((ordered_pair C D) != B)))))) /\ (All B, (All C, (All D, (((in (ordered_pair B C) T_1) /\ (in (ordered_pair B D) T_1)) => (C = D)))))) => ((relation T_1) /\ (function T_1)))) ### ConjTree 18 % 2.76/2.99 20. (-. (All A, (((All B, (-. ((in B A) /\ (All C, (All D, ((ordered_pair C D) != B)))))) /\ (All B, (All C, (All D, (((in (ordered_pair B C) A) /\ (in (ordered_pair B D) A)) => (C = D)))))) => ((relation A) /\ (function A))))) ### NotAllEx 19 % 2.76/2.99 % SZS output end Proof % 2.76/2.99 (* END-PROOF *) %------------------------------------------------------------------------------