%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SET628+3 : TPTP v9.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n006.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.20s 0.37s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SET628+3 : TPTP v9.0.0. Released v2.2.0.
% 0.01/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n006.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 : 300
% 0.12/0.33 % DateTime : Fri Jun 20 05:31:35 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.20/0.37 % SZS status Theorem
% 0.20/0.37 % SZS output start Proof
% 0.20/0.37 tff(member_type, type, (
% 0.20/0.37 member: ( $i * $i ) > $o)).
% 0.20/0.37 tff(tptp_fun_B_3_type, type, (
% 0.20/0.37 tptp_fun_B_3: $i)).
% 0.20/0.37 tff(tptp_fun_D_1_type, type, (
% 0.20/0.37 tptp_fun_D_1: ( $i * $i ) > $i)).
% 0.20/0.37 tff(empty_set_type, type, (
% 0.20/0.37 empty_set: $i)).
% 0.20/0.37 tff(not_equal_type, type, (
% 0.20/0.37 not_equal: ( $i * $i ) > $o)).
% 0.20/0.37 tff(tptp_fun_D_0_type, type, (
% 0.20/0.37 tptp_fun_D_0: ( $i * $i ) > $i)).
% 0.20/0.37 tff(intersect_type, type, (
% 0.20/0.37 intersect: ( $i * $i ) > $o)).
% 0.20/0.37 tff(1,plain,
% 0.20/0.37 (^[B: $i, C: $i, D: $i] : refl((~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(2,plain,
% 0.20/0.37 (![B: $i, C: $i, D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![B: $i, C: $i, D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.37 tff(3,plain,
% 0.20/0.37 (![B: $i, C: $i] : ![D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![B: $i, C: $i, D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(pull_quant,[status(thm)],[])).
% 0.20/0.37 tff(4,plain,
% 0.20/0.37 (^[B: $i, C: $i] : trans(monotonicity(trans(monotonicity(trans(monotonicity(pull_quant(((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C))) <=> ![D: $i] : ((~(B = C)) | (member(D, B) <=> member(D, C)))), ((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) <=> (~![D: $i] : ((~(B = C)) | (member(D, B) <=> member(D, C)))))), pull_quant((~![D: $i] : ((~(B = C)) | (member(D, B) <=> member(D, C)))) <=> ?[D: $i] : (~((~(B = C)) | (member(D, B) <=> member(D, C))))), ((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) <=> ?[D: $i] : (~((~(B = C)) | (member(D, B) <=> member(D, C)))))), (((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))) <=> (?[D: $i] : (~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))), pull_quant((?[D: $i] : (~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))) <=> ?[D: $i] : ((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))), (((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))) <=> ?[D: $i] : ((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))), ((~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> (~?[D: $i] : ((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))))), pull_quant((~?[D: $i] : ((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))), ((~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(5,plain,
% 0.20/0.37 (![B: $i, C: $i] : (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![B: $i, C: $i] : ![D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(quant_intro,[status(thm)],[4])).
% 0.20/0.37 tff(6,plain,
% 0.20/0.37 (![B: $i, C: $i] : (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![B: $i, C: $i, D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(transitivity,[status(thm)],[5, 3])).
% 0.20/0.37 tff(7,plain,
% 0.20/0.37 (![B: $i, C: $i] : (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![B: $i, C: $i, D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(transitivity,[status(thm)],[6, 2])).
% 0.20/0.37 tff(8,plain,
% 0.20/0.37 (^[B: $i, C: $i] : rewrite((~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(9,plain,
% 0.20/0.37 (![B: $i, C: $i] : (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![B: $i, C: $i] : (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(quant_intro,[status(thm)],[8])).
% 0.20/0.37 tff(10,plain,
% 0.20/0.37 (![B: $i, C: $i] : (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))) <=> ![B: $i, C: $i, D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(transitivity,[status(thm)],[9, 7])).
% 0.20/0.37 tff(11,plain,
% 0.20/0.37 (^[B: $i, C: $i] : trans(monotonicity(rewrite(((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C))) <=> ((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))), trans(monotonicity(rewrite((~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))) <=> (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))), (((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))) <=> ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))), rewrite(((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))) <=> ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))), (((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))) <=> ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))), ((((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C))) & ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))) <=> (((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C))) & ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))))), rewrite((((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C))) & ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))) <=> (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))), ((((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C))) & ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))) <=> (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(12,plain,
% 0.20/0.37 (![B: $i, C: $i] : (((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C))) & ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C))))) <=> ![B: $i, C: $i] : (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(quant_intro,[status(thm)],[11])).
% 0.20/0.37 tff(13,plain,
% 0.20/0.37 (![B: $i, C: $i] : ((B = C) <=> ![D: $i] : (member(D, B) <=> member(D, C))) <=> ![B: $i, C: $i] : ((B = C) <=> ![D: $i] : (member(D, B) <=> member(D, C)))),
% 0.20/0.37 inference(rewrite,[status(thm)],[])).
% 0.20/0.37 tff(14,axiom,(![B: $i, C: $i] : ((B = C) <=> ![D: $i] : (member(D, B) <=> member(D, C)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','equal_member_defn')).
% 0.20/0.37 tff(15,plain,
% 0.20/0.37 (![B: $i, C: $i] : ((B = C) <=> ![D: $i] : (member(D, B) <=> member(D, C)))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[14, 13])).
% 0.20/0.37 tff(16,plain,(
% 0.20/0.37 ![B: $i, C: $i] : (((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C))) & ((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))),
% 0.20/0.37 inference(skolemize,[status(sab)],[15])).
% 0.20/0.37 tff(17,plain,
% 0.20/0.37 (![B: $i, C: $i] : (~((~((~(B = C)) | ![D: $i] : (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.20/0.37 tff(18,plain,
% 0.20/0.37 (![B: $i, C: $i, D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[17, 10])).
% 0.20/0.37 tff(19,plain,
% 0.20/0.37 ((~![B: $i, C: $i, D: $i] : (~((~((~(B = C)) | (member(D, B) <=> member(D, C)))) | (~((B = C) | (~(member(tptp_fun_D_1(C, B), B) <=> member(tptp_fun_D_1(C, B), C)))))))) | (~((~((~(empty_set = B!3)) | (member(empty_set, empty_set) <=> member(empty_set, B!3)))) | (~((empty_set = B!3) | (~(member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3)))))))),
% 0.20/0.37 inference(quant_inst,[status(thm)],[])).
% 0.20/0.37 tff(20,plain,
% 0.20/0.37 (~((~((~(empty_set = B!3)) | (member(empty_set, empty_set) <=> member(empty_set, B!3)))) | (~((empty_set = B!3) | (~(member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3))))))),
% 0.20/0.37 inference(unit_resolution,[status(thm)],[19, 18])).
% 0.20/0.37 tff(21,plain,
% 0.20/0.37 (((~((~(empty_set = B!3)) | (member(empty_set, empty_set) <=> member(empty_set, B!3)))) | (~((empty_set = B!3) | (~(member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3)))))) | ((empty_set = B!3) | (~(member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3))))),
% 0.20/0.37 inference(tautology,[status(thm)],[])).
% 0.20/0.37 tff(22,plain,
% 0.20/0.37 ((empty_set = B!3) | (~(member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3)))),
% 0.20/0.37 inference(unit_resolution,[status(thm)],[21, 20])).
% 0.20/0.37 tff(23,plain,
% 0.20/0.37 ((empty_set = B!3) <=> (B!3 = empty_set)),
% 0.20/0.37 inference(commutativity,[status(thm)],[])).
% 0.20/0.37 tff(24,plain,
% 0.20/0.37 ((B!3 = empty_set) <=> (empty_set = B!3)),
% 0.20/0.37 inference(symmetry,[status(thm)],[23])).
% 0.20/0.37 tff(25,plain,
% 0.20/0.37 ((~(B!3 = empty_set)) <=> (~(empty_set = B!3))),
% 0.20/0.37 inference(monotonicity,[status(thm)],[24])).
% 0.20/0.37 tff(26,assumption,(~not_equal(B!3, empty_set)), introduced(assumption)).
% 0.20/0.37 tff(27,plain,
% 0.20/0.37 (^[B: $i, C: $i] : refl((~((B = C) <=> not_equal(B, C))) <=> (~((B = C) <=> not_equal(B, C))))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(28,plain,
% 0.20/0.37 (![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C))) <=> ![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C)))),
% 0.20/0.37 inference(quant_intro,[status(thm)],[27])).
% 0.20/0.37 tff(29,plain,
% 0.20/0.37 (![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C))) <=> ![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C)))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(30,plain,
% 0.20/0.38 (^[B: $i, C: $i] : trans(rewrite((not_equal(B, C) <=> (~(B = C))) <=> (~((B = C) <=> not_equal(B, C)))), rewrite((~((B = C) <=> not_equal(B, C))) <=> (~((B = C) <=> not_equal(B, C)))), ((not_equal(B, C) <=> (~(B = C))) <=> (~((B = C) <=> not_equal(B, C)))))),
% 0.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(31,plain,
% 0.20/0.38 (![B: $i, C: $i] : (not_equal(B, C) <=> (~(B = C))) <=> ![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C)))),
% 0.20/0.38 inference(quant_intro,[status(thm)],[30])).
% 0.20/0.38 tff(32,axiom,(![B: $i, C: $i] : (not_equal(B, C) <=> (~(B = C)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','not_equal_defn')).
% 0.20/0.38 tff(33,plain,
% 0.20/0.38 (![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[32, 31])).
% 0.20/0.38 tff(34,plain,
% 0.20/0.38 (![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[33, 29])).
% 0.20/0.38 tff(35,plain,(
% 0.20/0.38 ![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C)))),
% 0.20/0.38 inference(skolemize,[status(sab)],[34])).
% 0.20/0.38 tff(36,plain,
% 0.20/0.38 (![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[35, 28])).
% 0.20/0.38 tff(37,plain,
% 0.20/0.38 ((~![B: $i, C: $i] : (~((B = C) <=> not_equal(B, C)))) | (~((B!3 = empty_set) <=> not_equal(B!3, empty_set)))),
% 0.20/0.38 inference(quant_inst,[status(thm)],[])).
% 0.20/0.38 tff(38,plain,
% 0.20/0.38 (~((B!3 = empty_set) <=> not_equal(B!3, empty_set))),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[37, 36])).
% 0.20/0.38 tff(39,plain,
% 0.20/0.38 (((B!3 = empty_set) <=> not_equal(B!3, empty_set)) | (B!3 = empty_set) | not_equal(B!3, empty_set)),
% 0.20/0.38 inference(tautology,[status(thm)],[])).
% 0.20/0.38 tff(40,plain,
% 0.20/0.38 ((B!3 = empty_set) | not_equal(B!3, empty_set)),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[39, 38])).
% 0.20/0.38 tff(41,plain,
% 0.20/0.38 (B!3 = empty_set),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[40, 26])).
% 0.20/0.38 tff(42,plain,
% 0.20/0.38 (empty_set = B!3),
% 0.20/0.38 inference(symmetry,[status(thm)],[41])).
% 0.20/0.38 tff(43,plain,
% 0.20/0.38 (member(tptp_fun_D_0(B!3, B!3), empty_set) <=> member(tptp_fun_D_0(B!3, B!3), B!3)),
% 0.20/0.38 inference(monotonicity,[status(thm)],[42])).
% 0.20/0.38 tff(44,plain,
% 0.20/0.38 (member(tptp_fun_D_0(B!3, B!3), B!3) <=> member(tptp_fun_D_0(B!3, B!3), empty_set)),
% 0.20/0.38 inference(symmetry,[status(thm)],[43])).
% 0.20/0.38 tff(45,plain,
% 0.20/0.38 ((~(intersect(B!3, B!3) <=> not_equal(B!3, empty_set))) <=> (~(intersect(B!3, B!3) <=> not_equal(B!3, empty_set)))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(46,plain,
% 0.20/0.38 ((~![B: $i] : (intersect(B, B) <=> not_equal(B, empty_set))) <=> (~![B: $i] : (intersect(B, B) <=> not_equal(B, empty_set)))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(47,axiom,(~![B: $i] : (intersect(B, B) <=> not_equal(B, empty_set))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_th110')).
% 0.20/0.38 tff(48,plain,
% 0.20/0.38 (~![B: $i] : (intersect(B, B) <=> not_equal(B, empty_set))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[47, 46])).
% 0.20/0.38 tff(49,plain,
% 0.20/0.38 (~![B: $i] : (intersect(B, B) <=> not_equal(B, empty_set))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[48, 46])).
% 0.20/0.38 tff(50,plain,
% 0.20/0.38 (~![B: $i] : (intersect(B, B) <=> not_equal(B, empty_set))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[49, 46])).
% 0.20/0.38 tff(51,plain,
% 0.20/0.38 (~![B: $i] : (intersect(B, B) <=> not_equal(B, empty_set))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[50, 46])).
% 0.20/0.38 tff(52,plain,(
% 0.20/0.38 ~(intersect(B!3, B!3) <=> not_equal(B!3, empty_set))),
% 0.20/0.38 inference(skolemize,[status(sab)],[51])).
% 0.20/0.38 tff(53,plain,
% 0.20/0.38 (~(intersect(B!3, B!3) <=> not_equal(B!3, empty_set))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[52, 45])).
% 0.20/0.38 tff(54,plain,
% 0.20/0.38 ((intersect(B!3, B!3) <=> not_equal(B!3, empty_set)) | intersect(B!3, B!3) | not_equal(B!3, empty_set)),
% 0.20/0.38 inference(tautology,[status(thm)],[])).
% 0.20/0.38 tff(55,plain,
% 0.20/0.38 (intersect(B!3, B!3) | not_equal(B!3, empty_set)),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[54, 53])).
% 0.20/0.38 tff(56,plain,
% 0.20/0.38 (intersect(B!3, B!3)),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[55, 26])).
% 0.20/0.38 tff(57,plain,
% 0.20/0.38 (^[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.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(58,plain,
% 0.20/0.38 (![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.20/0.38 inference(quant_intro,[status(thm)],[57])).
% 0.20/0.38 tff(59,plain,
% 0.20/0.38 (^[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.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(60,plain,
% 0.20/0.38 (![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.20/0.38 inference(quant_intro,[status(thm)],[59])).
% 0.20/0.38 tff(61,plain,
% 0.20/0.38 (![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.20/0.38 inference(transitivity,[status(thm)],[60, 58])).
% 0.20/0.38 tff(62,plain,
% 0.20/0.38 (^[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.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(63,plain,
% 0.20/0.38 (![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.20/0.38 inference(quant_intro,[status(thm)],[62])).
% 0.20/0.38 tff(64,plain,
% 0.20/0.38 (![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.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(65,axiom,(![B: $i, C: $i] : (intersect(B, C) <=> ?[D: $i] : (member(D, B) & member(D, C)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','intersect_defn')).
% 0.20/0.38 tff(66,plain,
% 0.20/0.38 (![B: $i, C: $i] : (intersect(B, C) <=> ?[D: $i] : (member(D, B) & member(D, C)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[65, 64])).
% 0.20/0.38 tff(67,plain,(
% 0.20/0.38 ![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.20/0.38 inference(skolemize,[status(sab)],[66])).
% 0.20/0.38 tff(68,plain,
% 0.20/0.38 (![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.20/0.38 inference(modus_ponens,[status(thm)],[67, 63])).
% 0.20/0.38 tff(69,plain,
% 0.20/0.38 (![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.20/0.38 inference(modus_ponens,[status(thm)],[68, 61])).
% 0.20/0.38 tff(70,plain,
% 0.20/0.38 (((~![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!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3))))))) <=> ((~![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!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3)))))))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(71,plain,
% 0.20/0.38 ((~((~((~intersect(B!3, B!3)) | (~((~member(tptp_fun_D_0(B!3, B!3), B!3)) | (~member(tptp_fun_D_0(B!3, B!3), B!3)))))) | (~(intersect(B!3, B!3) | ![D: $i] : ((~member(D, B!3)) | (~member(D, B!3))))))) <=> (~((~((~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3))))))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(72,plain,
% 0.20/0.38 (((~![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!3, B!3)) | (~((~member(tptp_fun_D_0(B!3, B!3), B!3)) | (~member(tptp_fun_D_0(B!3, B!3), B!3)))))) | (~(intersect(B!3, B!3) | ![D: $i] : ((~member(D, B!3)) | (~member(D, B!3)))))))) <=> ((~![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!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3)))))))),
% 0.20/0.38 inference(monotonicity,[status(thm)],[71])).
% 0.20/0.38 tff(73,plain,
% 0.20/0.38 (((~![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!3, B!3)) | (~((~member(tptp_fun_D_0(B!3, B!3), B!3)) | (~member(tptp_fun_D_0(B!3, B!3), B!3)))))) | (~(intersect(B!3, B!3) | ![D: $i] : ((~member(D, B!3)) | (~member(D, B!3)))))))) <=> ((~![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!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3)))))))),
% 0.20/0.38 inference(transitivity,[status(thm)],[72, 70])).
% 0.20/0.38 tff(74,plain,
% 0.20/0.38 ((~![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!3, B!3)) | (~((~member(tptp_fun_D_0(B!3, B!3), B!3)) | (~member(tptp_fun_D_0(B!3, B!3), B!3)))))) | (~(intersect(B!3, B!3) | ![D: $i] : ((~member(D, B!3)) | (~member(D, B!3)))))))),
% 0.20/0.38 inference(quant_inst,[status(thm)],[])).
% 0.20/0.38 tff(75,plain,
% 0.20/0.38 ((~![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!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3))))))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[74, 73])).
% 0.20/0.38 tff(76,plain,
% 0.20/0.38 (~((~((~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3)))))),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[75, 69])).
% 0.20/0.38 tff(77,plain,
% 0.20/0.38 (((~((~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3))))) | ((~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))),
% 0.20/0.38 inference(tautology,[status(thm)],[])).
% 0.20/0.38 tff(78,plain,
% 0.20/0.38 ((~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3)),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[77, 76])).
% 0.20/0.38 tff(79,plain,
% 0.20/0.38 ((~((~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3)),
% 0.20/0.38 inference(tautology,[status(thm)],[])).
% 0.20/0.38 tff(80,plain,
% 0.20/0.38 ((~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3)),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[79, 78])).
% 0.20/0.38 tff(81,plain,
% 0.20/0.38 (member(tptp_fun_D_0(B!3, B!3), B!3)),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[80, 56])).
% 0.20/0.38 tff(82,plain,
% 0.20/0.38 (member(tptp_fun_D_0(B!3, B!3), empty_set)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[81, 44])).
% 0.20/0.38 tff(83,plain,
% 0.20/0.38 (^[B: $i] : refl((~member(B, empty_set)) <=> (~member(B, empty_set)))),
% 0.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(84,plain,
% 0.20/0.38 (![B: $i] : (~member(B, empty_set)) <=> ![B: $i] : (~member(B, empty_set))),
% 0.20/0.38 inference(quant_intro,[status(thm)],[83])).
% 0.20/0.38 tff(85,plain,
% 0.20/0.38 (![B: $i] : (~member(B, empty_set)) <=> ![B: $i] : (~member(B, empty_set))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(86,axiom,(![B: $i] : (~member(B, empty_set))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','empty_set_defn')).
% 0.20/0.38 tff(87,plain,
% 0.20/0.38 (![B: $i] : (~member(B, empty_set))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[86, 85])).
% 0.20/0.38 tff(88,plain,(
% 0.20/0.38 ![B: $i] : (~member(B, empty_set))),
% 0.20/0.38 inference(skolemize,[status(sab)],[87])).
% 0.20/0.38 tff(89,plain,
% 0.20/0.38 (![B: $i] : (~member(B, empty_set))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[88, 84])).
% 0.20/0.38 tff(90,plain,
% 0.20/0.38 ((~![B: $i] : (~member(B, empty_set))) | (~member(tptp_fun_D_0(B!3, B!3), empty_set))),
% 0.20/0.38 inference(quant_inst,[status(thm)],[])).
% 0.20/0.38 tff(91,plain,
% 0.20/0.38 (~member(tptp_fun_D_0(B!3, B!3), empty_set)),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[90, 89])).
% 0.20/0.38 tff(92,plain,
% 0.20/0.38 ($false),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[91, 82])).
% 0.20/0.38 tff(93,plain,(not_equal(B!3, empty_set)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.38 tff(94,plain,
% 0.20/0.38 (((B!3 = empty_set) <=> not_equal(B!3, empty_set)) | (~(B!3 = empty_set)) | (~not_equal(B!3, empty_set))),
% 0.20/0.38 inference(tautology,[status(thm)],[])).
% 0.20/0.38 tff(95,plain,
% 0.20/0.38 ((~(B!3 = empty_set)) | (~not_equal(B!3, empty_set))),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[94, 38])).
% 0.20/0.38 tff(96,plain,
% 0.20/0.38 (~(B!3 = empty_set)),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[95, 93])).
% 0.20/0.38 tff(97,plain,
% 0.20/0.38 (~(empty_set = B!3)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[96, 25])).
% 0.20/0.38 tff(98,plain,
% 0.20/0.38 ((~((empty_set = B!3) | (~(member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3))))) | (empty_set = B!3) | (~(member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3)))),
% 0.20/0.38 inference(tautology,[status(thm)],[])).
% 0.20/0.38 tff(99,plain,
% 0.20/0.38 (~(member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[98, 97, 22])).
% 0.20/0.39 tff(100,plain,
% 0.20/0.39 ((intersect(B!3, B!3) <=> not_equal(B!3, empty_set)) | (~intersect(B!3, B!3)) | (~not_equal(B!3, empty_set))),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(101,plain,
% 0.20/0.39 ((~intersect(B!3, B!3)) | (~not_equal(B!3, empty_set))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[100, 53])).
% 0.20/0.39 tff(102,plain,
% 0.20/0.39 (~intersect(B!3, B!3)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[101, 93])).
% 0.20/0.39 tff(103,plain,
% 0.20/0.39 (((~((~intersect(B!3, B!3)) | member(tptp_fun_D_0(B!3, B!3), B!3))) | (~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3))))) | (intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3)))),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(104,plain,
% 0.20/0.39 (intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[103, 76])).
% 0.20/0.39 tff(105,plain,
% 0.20/0.39 ((~(intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3)))) | intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3))),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(106,plain,
% 0.20/0.39 (intersect(B!3, B!3) | ![D: $i] : (~member(D, B!3))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[105, 104])).
% 0.20/0.39 tff(107,plain,
% 0.20/0.39 (![D: $i] : (~member(D, B!3))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[106, 102])).
% 0.20/0.39 tff(108,plain,
% 0.20/0.39 ((~![D: $i] : (~member(D, B!3))) | (~member(tptp_fun_D_1(B!3, empty_set), B!3))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(109,plain,
% 0.20/0.39 (~member(tptp_fun_D_1(B!3, empty_set), B!3)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[108, 107])).
% 0.20/0.39 tff(110,plain,
% 0.20/0.39 ((~![B: $i] : (~member(B, empty_set))) | (~member(tptp_fun_D_1(B!3, empty_set), empty_set))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(111,plain,
% 0.20/0.39 (~member(tptp_fun_D_1(B!3, empty_set), empty_set)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[110, 89])).
% 0.20/0.39 tff(112,plain,
% 0.20/0.39 ((member(tptp_fun_D_1(B!3, empty_set), empty_set) <=> member(tptp_fun_D_1(B!3, empty_set), B!3)) | member(tptp_fun_D_1(B!3, empty_set), empty_set) | member(tptp_fun_D_1(B!3, empty_set), B!3)),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(113,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[112, 111, 109, 99])).
% 0.20/0.39 % SZS output end Proof
% 0.20/0.39 % E exiting
%------------------------------------------------------------------------------