%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SET627+3 : TPTP v9.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n010.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 : 300s
% DateTime : Sat Jun 21 05:26:03 AM UTC 2025
% Result : Theorem 0.11s 0.36s
% Output : Proof 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET627+3 : TPTP v9.0.0. Released v2.2.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 20 05:33:41 EDT 2025
% 0.11/0.33 % CPUTime :
% 0.11/0.36 % SZS status Theorem
% 0.11/0.36 % SZS output start Proof
% 0.11/0.36 tff(member_type, type, (
% 0.11/0.36 member: ( $i * $i ) > $o)).
% 0.11/0.36 tff(empty_set_type, type, (
% 0.11/0.36 empty_set: $i)).
% 0.11/0.36 tff(tptp_fun_D_0_type, type, (
% 0.11/0.36 tptp_fun_D_0: ( $i * $i ) > $i)).
% 0.11/0.36 tff(tptp_fun_B_2_type, type, (
% 0.11/0.36 tptp_fun_B_2: $i)).
% 0.11/0.36 tff(intersect_type, type, (
% 0.11/0.36 intersect: ( $i * $i ) > $o)).
% 0.11/0.36 tff(disjoint_type, type, (
% 0.11/0.36 disjoint: ( $i * $i ) > $o)).
% 0.11/0.36 tff(1,plain,
% 0.11/0.36 (^[B: $i, C: $i] : refl((~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))))) <=> (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))))))),
% 0.11/0.36 inference(bind,[status(th)],[])).
% 0.11/0.36 tff(2,plain,
% 0.11/0.36 (![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))))) <=> ![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))),
% 0.11/0.36 inference(quant_intro,[status(thm)],[1])).
% 0.11/0.36 tff(3,plain,
% 0.11/0.36 (^[B: $i, C: $i] : rewrite((~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))))) <=> (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))))))),
% 0.11/0.36 inference(bind,[status(th)],[])).
% 0.11/0.36 tff(4,plain,
% 0.11/0.36 (![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))))) <=> ![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))),
% 0.11/0.36 inference(quant_intro,[status(thm)],[3])).
% 0.11/0.36 tff(5,plain,
% 0.11/0.36 (![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))))) <=> ![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))),
% 0.11/0.36 inference(transitivity,[status(thm)],[4, 2])).
% 0.11/0.36 tff(6,plain,
% 0.11/0.36 (^[B: $i, C: $i] : trans(monotonicity(rewrite(((~intersect(B, C)) | (member(tptp_fun_D_0(C, B), B) & member(tptp_fun_D_0(C, B), C))) <=> ((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))), rewrite((intersect(B, C) | ![D: $i] : (~(member(D, B) & member(D, C)))) <=> (intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))), ((((~intersect(B, C)) | (member(tptp_fun_D_0(C, B), B) & member(tptp_fun_D_0(C, B), C))) & (intersect(B, C) | ![D: $i] : (~(member(D, B) & member(D, C))))) <=> (((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C))))) & (intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))))), rewrite((((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C))))) & (intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B))))) <=> (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))), ((((~intersect(B, C)) | (member(tptp_fun_D_0(C, B), B) & member(tptp_fun_D_0(C, B), C))) & (intersect(B, C) | ![D: $i] : (~(member(D, B) & member(D, C))))) <=> (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))))),
% 0.11/0.36 inference(bind,[status(th)],[])).
% 0.11/0.37 tff(7,plain,
% 0.11/0.37 (![B: $i, C: $i] : (((~intersect(B, C)) | (member(tptp_fun_D_0(C, B), B) & member(tptp_fun_D_0(C, B), C))) & (intersect(B, C) | ![D: $i] : (~(member(D, B) & member(D, C))))) <=> ![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))),
% 0.11/0.37 inference(quant_intro,[status(thm)],[6])).
% 0.11/0.37 tff(8,plain,
% 0.11/0.37 (![B: $i, C: $i] : (intersect(B, C) <=> ?[D: $i] : (member(D, B) & member(D, C))) <=> ![B: $i, C: $i] : (intersect(B, C) <=> ?[D: $i] : (member(D, B) & member(D, C)))),
% 0.11/0.37 inference(rewrite,[status(thm)],[])).
% 0.11/0.37 tff(9,axiom,(![B: $i, C: $i] : (intersect(B, C) <=> ?[D: $i] : (member(D, B) & member(D, C)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','intersect_defn')).
% 0.11/0.37 tff(10,plain,
% 0.11/0.37 (![B: $i, C: $i] : (intersect(B, C) <=> ?[D: $i] : (member(D, B) & member(D, C)))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[9, 8])).
% 0.11/0.37 tff(11,plain,(
% 0.11/0.37 ![B: $i, C: $i] : (((~intersect(B, C)) | (member(tptp_fun_D_0(C, B), B) & member(tptp_fun_D_0(C, B), C))) & (intersect(B, C) | ![D: $i] : (~(member(D, B) & member(D, C)))))),
% 0.11/0.37 inference(skolemize,[status(sab)],[10])).
% 0.11/0.37 tff(12,plain,
% 0.11/0.37 (![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[11, 7])).
% 0.11/0.37 tff(13,plain,
% 0.11/0.37 (![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[12, 5])).
% 0.11/0.37 tff(14,plain,
% 0.11/0.37 (((~![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))) | (~((~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))) | (~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))))))))) <=> ((~![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))) | (~((~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))) | (~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))))))),
% 0.11/0.37 inference(rewrite,[status(thm)],[])).
% 0.11/0.37 tff(15,plain,
% 0.11/0.37 ((~((~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))) | (~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))))) <=> (~((~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))) | (~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))))))))),
% 0.11/0.37 inference(rewrite,[status(thm)],[])).
% 0.11/0.37 tff(16,plain,
% 0.11/0.37 (((~![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))) | (~((~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))) | (~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2)))))))) <=> ((~![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))) | (~((~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))) | (~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))))))),
% 0.11/0.37 inference(monotonicity,[status(thm)],[15])).
% 0.11/0.37 tff(17,plain,
% 0.11/0.37 (((~![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))) | (~((~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))) | (~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2)))))))) <=> ((~![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))) | (~((~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))) | (~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))))))),
% 0.11/0.37 inference(transitivity,[status(thm)],[16, 14])).
% 0.11/0.37 tff(18,plain,
% 0.11/0.37 ((~![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))) | (~((~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))) | (~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2)))))))),
% 0.11/0.37 inference(quant_inst,[status(thm)],[])).
% 0.11/0.37 tff(19,plain,
% 0.11/0.37 ((~![B: $i, C: $i] : (~((~((~intersect(B, C)) | (~((~member(tptp_fun_D_0(C, B), B)) | (~member(tptp_fun_D_0(C, B), C)))))) | (~(intersect(B, C) | ![D: $i] : ((~member(D, C)) | (~member(D, B)))))))) | (~((~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))) | (~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))))))))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[18, 17])).
% 0.11/0.37 tff(20,plain,
% 0.11/0.37 (~((~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))) | (~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))))),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[19, 13])).
% 0.11/0.37 tff(21,plain,
% 0.11/0.37 (((~(intersect(B!2, empty_set) | ![D: $i] : ((~member(D, empty_set)) | (~member(D, B!2))))) | (~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))))))) | ((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))),
% 0.11/0.37 inference(tautology,[status(thm)],[])).
% 0.11/0.37 tff(22,plain,
% 0.11/0.37 ((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))))),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[21, 20])).
% 0.11/0.37 tff(23,plain,
% 0.11/0.37 (^[B: $i, C: $i] : refl((~(intersect(B, C) <=> disjoint(B, C))) <=> (~(intersect(B, C) <=> disjoint(B, C))))),
% 0.11/0.37 inference(bind,[status(th)],[])).
% 0.11/0.37 tff(24,plain,
% 0.11/0.37 (![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C))) <=> ![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C)))),
% 0.11/0.37 inference(quant_intro,[status(thm)],[23])).
% 0.11/0.37 tff(25,plain,
% 0.11/0.37 (![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C))) <=> ![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C)))),
% 0.11/0.37 inference(rewrite,[status(thm)],[])).
% 0.11/0.37 tff(26,plain,
% 0.11/0.37 (^[B: $i, C: $i] : trans(rewrite((disjoint(B, C) <=> (~intersect(B, C))) <=> (~(intersect(B, C) <=> disjoint(B, C)))), rewrite((~(intersect(B, C) <=> disjoint(B, C))) <=> (~(intersect(B, C) <=> disjoint(B, C)))), ((disjoint(B, C) <=> (~intersect(B, C))) <=> (~(intersect(B, C) <=> disjoint(B, C)))))),
% 0.11/0.37 inference(bind,[status(th)],[])).
% 0.11/0.37 tff(27,plain,
% 0.11/0.37 (![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C))) <=> ![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C)))),
% 0.11/0.37 inference(quant_intro,[status(thm)],[26])).
% 0.11/0.37 tff(28,axiom,(![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','disjoint_defn')).
% 0.11/0.37 tff(29,plain,
% 0.11/0.37 (![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C)))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[28, 27])).
% 0.11/0.37 tff(30,plain,
% 0.11/0.37 (![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C)))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[29, 25])).
% 0.11/0.37 tff(31,plain,(
% 0.11/0.37 ![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C)))),
% 0.11/0.37 inference(skolemize,[status(sab)],[30])).
% 0.11/0.37 tff(32,plain,
% 0.11/0.37 (![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C)))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[31, 24])).
% 0.11/0.37 tff(33,plain,
% 0.11/0.37 ((~![B: $i, C: $i] : (~(intersect(B, C) <=> disjoint(B, C)))) | (~(intersect(B!2, empty_set) <=> disjoint(B!2, empty_set)))),
% 0.11/0.37 inference(quant_inst,[status(thm)],[])).
% 0.11/0.37 tff(34,plain,
% 0.11/0.37 (~(intersect(B!2, empty_set) <=> disjoint(B!2, empty_set))),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[33, 32])).
% 0.11/0.37 tff(35,plain,
% 0.11/0.37 ((~![B: $i] : disjoint(B, empty_set)) <=> (~![B: $i] : disjoint(B, empty_set))),
% 0.11/0.37 inference(rewrite,[status(thm)],[])).
% 0.11/0.37 tff(36,axiom,(~![B: $i] : disjoint(B, empty_set)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_th104')).
% 0.11/0.37 tff(37,plain,
% 0.11/0.37 (~![B: $i] : disjoint(B, empty_set)),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[36, 35])).
% 0.11/0.37 tff(38,plain,
% 0.11/0.37 (~![B: $i] : disjoint(B, empty_set)),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[37, 35])).
% 0.11/0.37 tff(39,plain,
% 0.11/0.37 (~![B: $i] : disjoint(B, empty_set)),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[38, 35])).
% 0.11/0.37 tff(40,plain,
% 0.11/0.37 (~![B: $i] : disjoint(B, empty_set)),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[39, 35])).
% 0.11/0.37 tff(41,plain,(
% 0.11/0.37 ~disjoint(B!2, empty_set)),
% 0.11/0.37 inference(skolemize,[status(sab)],[40])).
% 0.11/0.37 tff(42,plain,
% 0.11/0.37 ((intersect(B!2, empty_set) <=> disjoint(B!2, empty_set)) | intersect(B!2, empty_set) | disjoint(B!2, empty_set)),
% 0.11/0.37 inference(tautology,[status(thm)],[])).
% 0.11/0.37 tff(43,plain,
% 0.11/0.37 ((intersect(B!2, empty_set) <=> disjoint(B!2, empty_set)) | intersect(B!2, empty_set)),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[42, 41])).
% 0.11/0.37 tff(44,plain,
% 0.11/0.37 (intersect(B!2, empty_set)),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[43, 34])).
% 0.11/0.37 tff(45,plain,
% 0.11/0.37 ((~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))) | (~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))))),
% 0.11/0.37 inference(tautology,[status(thm)],[])).
% 0.11/0.37 tff(46,plain,
% 0.11/0.37 ((~((~intersect(B!2, empty_set)) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))))) | (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))))),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[45, 44])).
% 0.11/0.37 tff(47,plain,
% 0.11/0.37 (~((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set)))),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[46, 22])).
% 0.11/0.37 tff(48,plain,
% 0.11/0.37 (((~member(tptp_fun_D_0(empty_set, B!2), B!2)) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))) | member(tptp_fun_D_0(empty_set, B!2), empty_set)),
% 0.11/0.37 inference(tautology,[status(thm)],[])).
% 0.11/0.37 tff(49,plain,
% 0.11/0.37 (member(tptp_fun_D_0(empty_set, B!2), empty_set)),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[48, 47])).
% 0.11/0.37 tff(50,plain,
% 0.11/0.37 (^[B: $i] : refl((~member(B, empty_set)) <=> (~member(B, empty_set)))),
% 0.11/0.37 inference(bind,[status(th)],[])).
% 0.11/0.37 tff(51,plain,
% 0.11/0.37 (![B: $i] : (~member(B, empty_set)) <=> ![B: $i] : (~member(B, empty_set))),
% 0.11/0.37 inference(quant_intro,[status(thm)],[50])).
% 0.11/0.37 tff(52,plain,
% 0.11/0.37 (![B: $i] : (~member(B, empty_set)) <=> ![B: $i] : (~member(B, empty_set))),
% 0.11/0.37 inference(rewrite,[status(thm)],[])).
% 0.11/0.37 tff(53,axiom,(![B: $i] : (~member(B, empty_set))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','empty_set_defn')).
% 0.11/0.37 tff(54,plain,
% 0.11/0.37 (![B: $i] : (~member(B, empty_set))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[53, 52])).
% 0.11/0.37 tff(55,plain,(
% 0.11/0.37 ![B: $i] : (~member(B, empty_set))),
% 0.11/0.37 inference(skolemize,[status(sab)],[54])).
% 0.11/0.37 tff(56,plain,
% 0.11/0.37 (![B: $i] : (~member(B, empty_set))),
% 0.11/0.37 inference(modus_ponens,[status(thm)],[55, 51])).
% 0.11/0.37 tff(57,plain,
% 0.11/0.37 ((~![B: $i] : (~member(B, empty_set))) | (~member(tptp_fun_D_0(empty_set, B!2), empty_set))),
% 0.11/0.37 inference(quant_inst,[status(thm)],[])).
% 0.11/0.37 tff(58,plain,
% 0.11/0.37 ($false),
% 0.11/0.37 inference(unit_resolution,[status(thm)],[57, 56, 49])).
% 0.11/0.37 % SZS output end Proof
% 0.11/0.37 % E exiting
%------------------------------------------------------------------------------