TSTP Solution File: SET199+3 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SET199+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% Computer : n003.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:40:18 EDT 2022
% Result : Theorem 0.40s 0.57s
% Output : Proof 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET199+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.34 % Computer : n003.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 : Sun Jul 10 02:00:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.40/0.57 % SZS status Theorem
% 0.40/0.57 (* PROOF-FOUND *)
% 0.40/0.57 (* BEGIN-PROOF *)
% 0.40/0.57 % SZS output start Proof
% 0.40/0.57 1. (member T_0 T_1) (-. (member T_0 T_1)) ### Axiom
% 0.40/0.57 2. (-. (member T_0 T_2)) (member T_0 T_2) ### Axiom
% 0.40/0.57 3. ((member T_0 T_1) => (member T_0 T_2)) (-. (member T_0 T_2)) (member T_0 T_1) ### Imply 1 2
% 0.40/0.57 4. (All D, ((member D T_1) => (member D T_2))) (member T_0 T_1) (-. (member T_0 T_2)) ### All 3
% 0.40/0.57 5. (member T_0 T_1) (-. (member T_0 T_1)) ### Axiom
% 0.40/0.57 6. (-. (member T_0 T_3)) (member T_0 T_3) ### Axiom
% 0.40/0.57 7. ((member T_0 T_1) => (member T_0 T_3)) (-. (member T_0 T_3)) (member T_0 T_1) ### Imply 5 6
% 0.40/0.57 8. (All D, ((member D T_1) => (member D T_3))) (member T_0 T_1) (-. (member T_0 T_3)) ### All 7
% 0.40/0.57 9. (-. ((member T_0 T_2) /\ (member T_0 T_3))) (All D, ((member D T_1) => (member D T_3))) (member T_0 T_1) (All D, ((member D T_1) => (member D T_2))) ### NotAnd 4 8
% 0.40/0.57 10. (-. (member T_0 (intersection T_2 T_3))) (member T_0 (intersection T_2 T_3)) ### Axiom
% 0.40/0.57 11. ((member T_0 (intersection T_2 T_3)) <=> ((member T_0 T_2) /\ (member T_0 T_3))) (-. (member T_0 (intersection T_2 T_3))) (All D, ((member D T_1) => (member D T_2))) (member T_0 T_1) (All D, ((member D T_1) => (member D T_3))) ### Equiv 9 10
% 0.40/0.57 12. (All D, ((member D (intersection T_2 T_3)) <=> ((member D T_2) /\ (member D T_3)))) (All D, ((member D T_1) => (member D T_3))) (member T_0 T_1) (All D, ((member D T_1) => (member D T_2))) (-. (member T_0 (intersection T_2 T_3))) ### All 11
% 0.40/0.57 13. (All C, (All D, ((member D (intersection T_2 C)) <=> ((member D T_2) /\ (member D C))))) (-. (member T_0 (intersection T_2 T_3))) (All D, ((member D T_1) => (member D T_2))) (member T_0 T_1) (All D, ((member D T_1) => (member D T_3))) ### All 12
% 0.40/0.57 14. (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) (All D, ((member D T_1) => (member D T_3))) (member T_0 T_1) (All D, ((member D T_1) => (member D T_2))) (-. (member T_0 (intersection T_2 T_3))) ### All 13
% 0.40/0.57 15. (-. ((member T_0 T_1) => (member T_0 (intersection T_2 T_3)))) (All D, ((member D T_1) => (member D T_2))) (All D, ((member D T_1) => (member D T_3))) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) ### NotImply 14
% 0.40/0.57 16. (-. (All D, ((member D T_1) => (member D (intersection T_2 T_3))))) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) (All D, ((member D T_1) => (member D T_3))) (All D, ((member D T_1) => (member D T_2))) ### NotAllEx 15
% 0.40/0.57 17. (-. (subset T_1 (intersection T_2 T_3))) (All D, ((member D T_1) => (member D T_2))) (All D, ((member D T_1) => (member D T_3))) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) ### Definition-Pseudo(subset) 16
% 0.40/0.57 18. (subset T_1 T_3) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) (All D, ((member D T_1) => (member D T_2))) (-. (subset T_1 (intersection T_2 T_3))) ### Definition-Pseudo(subset) 17
% 0.40/0.57 19. (subset T_1 T_2) (-. (subset T_1 (intersection T_2 T_3))) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) (subset T_1 T_3) ### Definition-Pseudo(subset) 18
% 0.40/0.57 20. (-. (((subset T_1 T_2) /\ (subset T_1 T_3)) => (subset T_1 (intersection T_2 T_3)))) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) ### ConjTree 19
% 0.40/0.57 21. (-. (All D, (((subset T_1 T_2) /\ (subset T_1 D)) => (subset T_1 (intersection T_2 D))))) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) ### NotAllEx 20
% 0.40/0.57 22. (-. (All C, (All D, (((subset T_1 C) /\ (subset T_1 D)) => (subset T_1 (intersection C D)))))) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) ### NotAllEx 21
% 0.40/0.57 23. (-. (All B, (All C, (All D, (((subset B C) /\ (subset B D)) => (subset B (intersection C D))))))) (All B, (All C, (All D, ((member D (intersection B C)) <=> ((member D B) /\ (member D C)))))) ### NotAllEx 22
% 0.40/0.57 % SZS output end Proof
% 0.40/0.57 (* END-PROOF *)
%------------------------------------------------------------------------------