TSTP Solution File: SET928+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SET928+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 : n023.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:06 EDT 2022
% Result : Theorem 12.25s 12.46s
% Output : Proof 12.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET928+1 : TPTP v8.1.0. Released v3.2.0.
% 0.09/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33 % Computer : n023.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 19:09:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 12.25/12.46 % SZS status Theorem
% 12.25/12.46 (* PROOF-FOUND *)
% 12.25/12.46 (* BEGIN-PROOF *)
% 12.25/12.46 % SZS output start Proof
% 12.25/12.46 1. (-. (in T_0 T_1)) (in T_0 T_1) ### Axiom
% 12.25/12.46 2. (-. (in T_2 T_1)) (in T_2 T_1) ### Axiom
% 12.25/12.46 3. ((set_difference (unordered_pair T_0 T_2) T_1) != (unordered_pair T_0 T_2)) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ### Axiom
% 12.25/12.46 4. (disjoint (unordered_pair T_0 T_2) T_1) ((set_difference (unordered_pair T_0 T_2) T_1) != (unordered_pair T_0 T_2)) ### Definition-Pseudo(disjoint) 3
% 12.25/12.46 5. (-. ((-. (in T_0 T_1)) /\ ((-. (in T_2 T_1)) /\ (-. (disjoint (unordered_pair T_0 T_2) T_1))))) ((set_difference (unordered_pair T_0 T_2) T_1) != (unordered_pair T_0 T_2)) (-. (in T_2 T_1)) (-. (in T_0 T_1)) ### DisjTree 1 2 4
% 12.25/12.46 6. (All C, (-. ((-. (in T_0 T_1)) /\ ((-. (in C T_1)) /\ (-. (disjoint (unordered_pair T_0 C) T_1)))))) (-. (in T_0 T_1)) (-. (in T_2 T_1)) ((set_difference (unordered_pair T_0 T_2) T_1) != (unordered_pair T_0 T_2)) ### All 5
% 12.25/12.46 7. (All B, (All C, (-. ((-. (in T_0 B)) /\ ((-. (in C B)) /\ (-. (disjoint (unordered_pair T_0 C) B))))))) ((set_difference (unordered_pair T_0 T_2) T_1) != (unordered_pair T_0 T_2)) (-. (in T_2 T_1)) (-. (in T_0 T_1)) ### All 6
% 12.25/12.46 8. (All A, (All B, (All C, (-. ((-. (in A B)) /\ ((-. (in C B)) /\ (-. (disjoint (unordered_pair A C) B)))))))) (-. (in T_0 T_1)) (-. (in T_2 T_1)) ((set_difference (unordered_pair T_0 T_2) T_1) != (unordered_pair T_0 T_2)) ### All 7
% 12.25/12.46 9. ((-. (in T_0 T_1)) /\ (-. (in T_2 T_1))) ((set_difference (unordered_pair T_0 T_2) T_1) != (unordered_pair T_0 T_2)) (All A, (All B, (All C, (-. ((-. (in A B)) /\ ((-. (in C B)) /\ (-. (disjoint (unordered_pair A C) B)))))))) ### And 8
% 12.25/12.46 10. ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ((set_difference (unordered_pair T_0 T_2) T_1) != (unordered_pair T_0 T_2)) ### Axiom
% 12.25/12.46 11. (-. (disjoint (unordered_pair T_0 T_2) T_1)) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ### Definition-Pseudo(disjoint) 10
% 12.25/12.46 12. (in T_0 T_1) (-. (in T_0 T_1)) ### Axiom
% 12.25/12.46 13. (-. ((disjoint (unordered_pair T_0 T_2) T_1) /\ (in T_0 T_1))) (in T_0 T_1) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ### NotAnd 11 12
% 12.25/12.46 14. (All C, (-. ((disjoint (unordered_pair T_0 T_2) C) /\ (in T_0 C)))) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) (in T_0 T_1) ### All 13
% 12.25/12.46 15. (All B, (All C, (-. ((disjoint (unordered_pair T_0 B) C) /\ (in T_0 C))))) (in T_0 T_1) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ### All 14
% 12.25/12.46 16. (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) (in T_0 T_1) ### All 15
% 12.25/12.46 17. (-. (-. (in T_0 T_1))) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) ### NotNot 16
% 12.25/12.46 18. ((unordered_pair T_2 T_0) = (unordered_pair T_0 T_2)) ((unordered_pair T_2 T_0) != (unordered_pair T_0 T_2)) ### Axiom
% 12.25/12.46 19. (T_1 != T_1) ### Refl(=)
% 12.25/12.46 20. ((set_difference (unordered_pair T_2 T_0) T_1) != (set_difference (unordered_pair T_0 T_2) T_1)) ((unordered_pair T_2 T_0) = (unordered_pair T_0 T_2)) ### NotEqual 18 19
% 12.25/12.46 21. ((unordered_pair T_2 T_0) = (unordered_pair T_0 T_2)) ((unordered_pair T_0 T_2) != (unordered_pair T_2 T_0)) ### Sym(=)
% 12.25/12.46 22. ((set_difference (unordered_pair T_2 T_0) T_1) != (unordered_pair T_2 T_0)) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ((unordered_pair T_2 T_0) = (unordered_pair T_0 T_2)) ### Trans 20 21
% 12.25/12.46 23. (-. (disjoint (unordered_pair T_2 T_0) T_1)) ((unordered_pair T_2 T_0) = (unordered_pair T_0 T_2)) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ### Definition-Pseudo(disjoint) 22
% 12.25/12.46 24. (in T_2 T_1) (-. (in T_2 T_1)) ### Axiom
% 12.25/12.46 25. (-. ((disjoint (unordered_pair T_2 T_0) T_1) /\ (in T_2 T_1))) (in T_2 T_1) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ((unordered_pair T_2 T_0) = (unordered_pair T_0 T_2)) ### NotAnd 23 24
% 12.25/12.46 26. (All C, (-. ((disjoint (unordered_pair T_2 T_0) C) /\ (in T_2 C)))) ((unordered_pair T_2 T_0) = (unordered_pair T_0 T_2)) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) (in T_2 T_1) ### All 25
% 12.25/12.46 27. (All B, (All C, (-. ((disjoint (unordered_pair T_2 B) C) /\ (in T_2 C))))) (in T_2 T_1) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ((unordered_pair T_2 T_0) = (unordered_pair T_0 T_2)) ### All 26
% 12.25/12.46 28. (All B, ((unordered_pair T_2 B) = (unordered_pair B T_2))) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) (in T_2 T_1) (All B, (All C, (-. ((disjoint (unordered_pair T_2 B) C) /\ (in T_2 C))))) ### All 27
% 12.25/12.46 29. (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (All B, (All C, (-. ((disjoint (unordered_pair T_2 B) C) /\ (in T_2 C))))) (in T_2 T_1) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ### All 28
% 12.25/12.46 30. (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) (in T_2 T_1) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) ### All 29
% 12.25/12.46 31. (-. (-. (in T_2 T_1))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) ### NotNot 30
% 12.25/12.46 32. (-. ((-. (in T_0 T_1)) /\ (-. (in T_2 T_1)))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) ((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) ### NotAnd 17 31
% 12.25/12.46 33. (-. (((set_difference (unordered_pair T_0 T_2) T_1) = (unordered_pair T_0 T_2)) <=> ((-. (in T_0 T_1)) /\ (-. (in T_2 T_1))))) (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (All A, (All B, (All C, (-. ((-. (in A B)) /\ ((-. (in C B)) /\ (-. (disjoint (unordered_pair A C) B)))))))) ### NotEquiv 9 32
% 12.25/12.46 34. (-. (All C, (((set_difference (unordered_pair T_0 T_2) C) = (unordered_pair T_0 T_2)) <=> ((-. (in T_0 C)) /\ (-. (in T_2 C)))))) (All A, (All B, (All C, (-. ((-. (in A B)) /\ ((-. (in C B)) /\ (-. (disjoint (unordered_pair A C) B)))))))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) ### NotAllEx 33
% 12.25/12.46 35. (-. (All B, (All C, (((set_difference (unordered_pair T_0 B) C) = (unordered_pair T_0 B)) <=> ((-. (in T_0 C)) /\ (-. (in B C))))))) (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (All A, (All B, (All C, (-. ((-. (in A B)) /\ ((-. (in C B)) /\ (-. (disjoint (unordered_pair A C) B)))))))) ### NotAllEx 34
% 12.25/12.46 36. (-. (All A, (All B, (All C, (((set_difference (unordered_pair A B) C) = (unordered_pair A B)) <=> ((-. (in A C)) /\ (-. (in B C)))))))) (All A, (All B, (All C, (-. ((-. (in A B)) /\ ((-. (in C B)) /\ (-. (disjoint (unordered_pair A C) B)))))))) (All A, (All B, ((unordered_pair A B) = (unordered_pair B A)))) (All A, (All B, (All C, (-. ((disjoint (unordered_pair A B) C) /\ (in A C)))))) ### NotAllEx 35
% 12.25/12.46 % SZS output end Proof
% 12.25/12.46 (* END-PROOF *)
%------------------------------------------------------------------------------