TSTP Solution File: SET886+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SET886+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 : n017.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:44:48 EDT 2022
% Result : Theorem 6.35s 6.62s
% Output : Proof 6.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33 % Computer : n017.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 : Mon Jul 11 08:06:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 6.35/6.62 % SZS status Theorem
% 6.35/6.62 (* PROOF-FOUND *)
% 6.35/6.62 (* BEGIN-PROOF *)
% 6.35/6.62 % SZS output start Proof
% 6.35/6.62 1. (subset (unordered_pair T_0 T_1) (singleton T_2)) (-. (subset (unordered_pair T_0 T_1) (singleton T_2))) ### Axiom
% 6.35/6.62 2. (T_0 != T_2) (T_0 = T_2) ### Axiom
% 6.35/6.62 3. ((subset (unordered_pair T_0 T_1) (singleton T_2)) => (T_0 = T_2)) (T_0 != T_2) (subset (unordered_pair T_0 T_1) (singleton T_2)) ### Imply 1 2
% 6.35/6.62 4. (All C, ((subset (unordered_pair T_0 T_1) (singleton C)) => (T_0 = C))) (subset (unordered_pair T_0 T_1) (singleton T_2)) (T_0 != T_2) ### All 3
% 6.35/6.62 5. (All B, (All C, ((subset (unordered_pair T_0 B) (singleton C)) => (T_0 = C)))) (T_0 != T_2) (subset (unordered_pair T_0 T_1) (singleton T_2)) ### All 4
% 6.35/6.62 6. (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) (subset (unordered_pair T_0 T_1) (singleton T_2)) (T_0 != T_2) ### All 5
% 6.35/6.62 7. ((unordered_pair T_1 T_0) = (unordered_pair T_0 T_1)) ((unordered_pair T_0 T_1) != (unordered_pair T_1 T_0)) ### Sym(=)
% 6.35/6.62 8. ((singleton T_2) != (singleton T_2)) ### Refl(=)
% 6.35/6.62 9. (-. (subset (unordered_pair T_1 T_0) (singleton T_2))) (subset (unordered_pair T_0 T_1) (singleton T_2)) ((unordered_pair T_1 T_0) = (unordered_pair T_0 T_1)) ### P-NotP 7 8
% 6.35/6.62 10. (T_1 != T_2) (T_1 = T_2) ### Axiom
% 6.35/6.62 11. ((subset (unordered_pair T_1 T_0) (singleton T_2)) => (T_1 = T_2)) (T_1 != T_2) ((unordered_pair T_1 T_0) = (unordered_pair T_0 T_1)) (subset (unordered_pair T_0 T_1) (singleton T_2)) ### Imply 9 10
% 6.35/6.62 12. (All C, ((subset (unordered_pair T_1 T_0) (singleton C)) => (T_1 = C))) (subset (unordered_pair T_0 T_1) (singleton T_2)) ((unordered_pair T_1 T_0) = (unordered_pair T_0 T_1)) (T_1 != T_2) ### All 11
% 6.35/6.62 13. (All B, (All C, ((subset (unordered_pair T_1 B) (singleton C)) => (T_1 = C)))) (T_1 != T_2) ((unordered_pair T_1 T_0) = (unordered_pair T_0 T_1)) (subset (unordered_pair T_0 T_1) (singleton T_2)) ### All 12
% 6.35/6.62 14. (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) (subset (unordered_pair T_0 T_1) (singleton T_2)) ((unordered_pair T_1 T_0) = (unordered_pair T_0 T_1)) (T_1 != T_2) ### All 13
% 6.35/6.62 15. (All B, ((unordered_pair T_1 B) = (unordered_pair B T_1))) (T_1 != T_2) (subset (unordered_pair T_0 T_1) (singleton T_2)) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) ### All 14
% 6.35/6.62 16. ((unordered_pair T_0 T_1) != (unordered_pair T_2 T_2)) (All B, ((unordered_pair T_1 B) = (unordered_pair B T_1))) (subset (unordered_pair T_0 T_1) (singleton T_2)) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) ### NotEqual 6 15
% 6.35/6.62 17. ((singleton T_2) != (singleton T_2)) ### Refl(=)
% 6.35/6.62 18. ((singleton T_2) != (singleton T_2)) ### Refl(=)
% 6.35/6.62 19. ((unordered_pair T_0 T_1) != (singleton T_2)) ((unordered_pair T_2 T_2) = (singleton T_2)) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) (subset (unordered_pair T_0 T_1) (singleton T_2)) (All B, ((unordered_pair T_1 B) = (unordered_pair B T_1))) ### TransEq 16 17 18
% 6.35/6.62 20. (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (subset (unordered_pair T_0 T_1) (singleton T_2)) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) ((unordered_pair T_2 T_2) = (singleton T_2)) ((unordered_pair T_0 T_1) != (singleton T_2)) ### All 19
% 6.35/6.62 21. (All A, ((unordered_pair A A) = (singleton A))) ((unordered_pair T_0 T_1) != (singleton T_2)) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) (subset (unordered_pair T_0 T_1) (singleton T_2)) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) ### All 20
% 6.35/6.62 22. (-. ((subset (unordered_pair T_0 T_1) (singleton T_2)) => ((unordered_pair T_0 T_1) = (singleton T_2)))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) (All A, ((unordered_pair A A) = (singleton A))) ### NotImply 21
% 6.35/6.62 23. (-. (All C, ((subset (unordered_pair T_0 T_1) (singleton C)) => ((unordered_pair T_0 T_1) = (singleton C))))) (All A, ((unordered_pair A A) = (singleton A))) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) ### NotAllEx 22
% 6.35/6.62 24. (-. (All B, (All C, ((subset (unordered_pair T_0 B) (singleton C)) => ((unordered_pair T_0 B) = (singleton C)))))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) (All A, ((unordered_pair A A) = (singleton A))) ### NotAllEx 23
% 6.35/6.62 25. (-. (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => ((unordered_pair A B) = (singleton C))))))) (All A, ((unordered_pair A A) = (singleton A))) (All A, (All B, (All C, ((subset (unordered_pair A B) (singleton C)) => (A = C))))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) ### NotAllEx 24
% 6.35/6.62 % SZS output end Proof
% 6.35/6.62 (* END-PROOF *)
%------------------------------------------------------------------------------