TSTP Solution File: SEU120+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% Computer : n011.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 14:48:25 EDT 2022
% Result : Theorem 5.19s 5.37s
% Output : Proof 5.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.32 % Computer : n011.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jun 19 23:34:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 5.19/5.37 % SZS status Theorem
% 5.19/5.37 (* PROOF-FOUND *)
% 5.19/5.37 (* BEGIN-PROOF *)
% 5.19/5.37 % SZS output start Proof
% 5.19/5.37 1. (All C, (-. (in C (set_intersection2 T_0 T_1)))) (-. (All C, (-. (in C (set_intersection2 T_0 T_1))))) ### Axiom
% 5.19/5.37 2. ((set_intersection2 T_0 T_1) != (empty_set)) ((set_intersection2 T_0 T_1) = (empty_set)) ### Axiom
% 5.19/5.37 3. (((set_intersection2 T_0 T_1) = (empty_set)) <=> (All C, (-. (in C (set_intersection2 T_0 T_1))))) ((set_intersection2 T_0 T_1) != (empty_set)) (All C, (-. (in C (set_intersection2 T_0 T_1)))) ### Equiv 1 2
% 5.19/5.37 4. (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) (All C, (-. (in C (set_intersection2 T_0 T_1)))) ((set_intersection2 T_0 T_1) != (empty_set)) ### All 3
% 5.19/5.37 5. (-. (disjoint T_0 T_1)) (All C, (-. (in C (set_intersection2 T_0 T_1)))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### Definition-Pseudo(disjoint) 4
% 5.19/5.37 6. ((-. (disjoint T_0 T_1)) /\ (All C, (-. (in C (set_intersection2 T_0 T_1))))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### And 5
% 5.19/5.37 7. (-. (-. ((-. (disjoint T_0 T_1)) /\ (All C, (-. (in C (set_intersection2 T_0 T_1))))))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### NotNot 6
% 5.19/5.37 8. ((set_intersection2 T_0 T_1) = (empty_set)) ((set_intersection2 T_0 T_1) != (empty_set)) ### Axiom
% 5.19/5.37 9. (in T_2 (set_intersection2 T_0 T_1)) (-. (in T_2 (set_intersection2 T_0 T_1))) ### Axiom
% 5.19/5.37 10. (All C, (-. (in C (set_intersection2 T_0 T_1)))) (in T_2 (set_intersection2 T_0 T_1)) ### All 9
% 5.19/5.37 11. (((set_intersection2 T_0 T_1) = (empty_set)) <=> (All C, (-. (in C (set_intersection2 T_0 T_1))))) (in T_2 (set_intersection2 T_0 T_1)) ((set_intersection2 T_0 T_1) = (empty_set)) ### Equiv 8 10
% 5.19/5.37 12. (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ((set_intersection2 T_0 T_1) = (empty_set)) (in T_2 (set_intersection2 T_0 T_1)) ### All 11
% 5.19/5.37 13. (disjoint T_0 T_1) (in T_2 (set_intersection2 T_0 T_1)) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### Definition-Pseudo(disjoint) 12
% 5.19/5.37 14. (Ex C, (in C (set_intersection2 T_0 T_1))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) (disjoint T_0 T_1) ### Exists 13
% 5.19/5.37 15. ((Ex C, (in C (set_intersection2 T_0 T_1))) /\ (disjoint T_0 T_1)) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### And 14
% 5.19/5.37 16. (-. (-. ((Ex C, (in C (set_intersection2 T_0 T_1))) /\ (disjoint T_0 T_1)))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### NotNot 15
% 5.19/5.37 17. (-. ((-. ((-. (disjoint T_0 T_1)) /\ (All C, (-. (in C (set_intersection2 T_0 T_1)))))) /\ (-. ((Ex C, (in C (set_intersection2 T_0 T_1))) /\ (disjoint T_0 T_1))))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### NotAnd 7 16
% 5.19/5.37 18. (-. (All B, ((-. ((-. (disjoint T_0 B)) /\ (All C, (-. (in C (set_intersection2 T_0 B)))))) /\ (-. ((Ex C, (in C (set_intersection2 T_0 B))) /\ (disjoint T_0 B)))))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### NotAllEx 17
% 5.19/5.37 19. (-. (All A, (All B, ((-. ((-. (disjoint A B)) /\ (All C, (-. (in C (set_intersection2 A B)))))) /\ (-. ((Ex C, (in C (set_intersection2 A B))) /\ (disjoint A B))))))) (All A, ((A = (empty_set)) <=> (All B, (-. (in B A))))) ### NotAllEx 18
% 5.19/5.37 % SZS output end Proof
% 5.19/5.37 (* END-PROOF *)
%------------------------------------------------------------------------------