%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SEU120+2 : 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 : n021.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 157.19s 157.47s % Output : Proof 157.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.0. % 0.04/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.12/0.33 % Computer : n021.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 Jun 19 13:22:17 EDT 2022 % 0.12/0.33 % CPUTime : % 157.19/157.47 % SZS status Theorem % 157.19/157.47 (* PROOF-FOUND *) % 157.19/157.47 (* BEGIN-PROOF *) % 157.19/157.47 % SZS output start Proof % 157.19/157.47 1. (All C, (-. (in C (set_intersection2 T_0 T_1)))) (-. (All C, (-. (in C (set_intersection2 T_0 T_1))))) ### Axiom % 157.19/157.47 2. ((set_intersection2 T_0 T_1) != (empty_set)) ((set_intersection2 T_0 T_1) = (empty_set)) ### Axiom % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 8. ((set_intersection2 T_0 T_1) = (empty_set)) ((set_intersection2 T_0 T_1) != (empty_set)) ### Axiom % 157.19/157.47 9. (in T_2 (set_intersection2 T_0 T_1)) (-. (in T_2 (set_intersection2 T_0 T_1))) ### Axiom % 157.19/157.47 10. (All C, (-. (in C (set_intersection2 T_0 T_1)))) (in T_2 (set_intersection2 T_0 T_1)) ### All 9 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 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 % 157.19/157.47 % SZS output end Proof % 157.19/157.47 (* END-PROOF *) %------------------------------------------------------------------------------