TSTP Solution File: SET638+3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET638+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n015.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 : Tue Sep 20 05:07:27 EDT 2022
% Result : Theorem 0.20s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET638+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Sep 3 07:15:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 0.20/0.40 % SZS status Theorem
% 0.20/0.40 % SZS output start Proof
% 0.20/0.40 tff(member_type, type, (
% 0.20/0.40 member: ( $i * $i ) > $o)).
% 0.20/0.40 tff(tptp_fun_C_4_type, type, (
% 0.20/0.40 tptp_fun_C_4: $i)).
% 0.20/0.40 tff(tptp_fun_D_0_type, type, (
% 0.20/0.40 tptp_fun_D_0: ( $i * $i ) > $i)).
% 0.20/0.40 tff(tptp_fun_B_5_type, type, (
% 0.20/0.40 tptp_fun_B_5: $i)).
% 0.20/0.40 tff(intersection_type, type, (
% 0.20/0.40 intersection: ( $i * $i ) > $i)).
% 0.20/0.40 tff(subset_type, type, (
% 0.20/0.40 subset: ( $i * $i ) > $o)).
% 0.20/0.40 tff(empty_set_type, type, (
% 0.20/0.40 empty_set: $i)).
% 0.20/0.40 tff(tptp_fun_D_3_type, type, (
% 0.20/0.40 tptp_fun_D_3: $i)).
% 0.20/0.40 tff(union_type, type, (
% 0.20/0.40 union: ( $i * $i ) > $i)).
% 0.20/0.40 tff(1,plain,
% 0.20/0.40 (^[B: $i, C: $i] : refl((~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))))) <=> (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(2,plain,
% 0.20/0.40 (![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))))) <=> ![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.40 tff(3,plain,
% 0.20/0.40 (^[B: $i, C: $i] : rewrite((~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))))) <=> (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(4,plain,
% 0.20/0.40 (![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))))) <=> ![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[3])).
% 0.20/0.40 tff(5,plain,
% 0.20/0.40 (![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))))) <=> ![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))),
% 0.20/0.40 inference(transitivity,[status(thm)],[4, 2])).
% 0.20/0.40 tff(6,plain,
% 0.20/0.40 (^[B: $i, C: $i] : trans(monotonicity(rewrite(((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C))) <=> ((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))), rewrite((subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))) <=> (subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))), ((((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C))) & (subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))) <=> (((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C))) & (subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))))), rewrite((((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C))) & (subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))) <=> (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))), ((((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C))) & (subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))) <=> (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(7,plain,
% 0.20/0.40 (![B: $i, C: $i] : (((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C))) & (subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C))))) <=> ![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[6])).
% 0.20/0.40 tff(8,plain,
% 0.20/0.40 (![B: $i, C: $i] : (subset(B, C) <=> ![D: $i] : ((~member(D, B)) | member(D, C))) <=> ![B: $i, C: $i] : (subset(B, C) <=> ![D: $i] : ((~member(D, B)) | member(D, C)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(9,plain,
% 0.20/0.40 (^[B: $i, C: $i] : rewrite((subset(B, C) <=> ![D: $i] : (member(D, B) => member(D, C))) <=> (subset(B, C) <=> ![D: $i] : ((~member(D, B)) | member(D, C))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(10,plain,
% 0.20/0.40 (![B: $i, C: $i] : (subset(B, C) <=> ![D: $i] : (member(D, B) => member(D, C))) <=> ![B: $i, C: $i] : (subset(B, C) <=> ![D: $i] : ((~member(D, B)) | member(D, C)))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[9])).
% 0.20/0.40 tff(11,axiom,(![B: $i, C: $i] : (subset(B, C) <=> ![D: $i] : (member(D, B) => member(D, C)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','subset_defn')).
% 0.20/0.40 tff(12,plain,
% 0.20/0.40 (![B: $i, C: $i] : (subset(B, C) <=> ![D: $i] : ((~member(D, B)) | member(D, C)))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[11, 10])).
% 0.20/0.40 tff(13,plain,
% 0.20/0.40 (![B: $i, C: $i] : (subset(B, C) <=> ![D: $i] : ((~member(D, B)) | member(D, C)))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[12, 8])).
% 0.20/0.40 tff(14,plain,(
% 0.20/0.40 ![B: $i, C: $i] : (((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C))) & (subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))),
% 0.20/0.40 inference(skolemize,[status(sab)],[13])).
% 0.20/0.40 tff(15,plain,
% 0.20/0.40 (![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[14, 7])).
% 0.20/0.40 tff(16,plain,
% 0.20/0.40 (![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[15, 5])).
% 0.20/0.40 tff(17,plain,
% 0.20/0.40 ((~![B: $i, C: $i] : (~((~((~subset(B, C)) | ![D: $i] : ((~member(D, B)) | member(D, C)))) | (~(subset(B, C) | (~((~member(tptp_fun_D_0(C, B), B)) | member(tptp_fun_D_0(C, B), C)))))))) | (~((~((~subset(B!5, C!4)) | ![D: $i] : ((~member(D, B!5)) | member(D, C!4)))) | (~(subset(B!5, C!4) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4)))))))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(18,plain,
% 0.20/0.40 (~((~((~subset(B!5, C!4)) | ![D: $i] : ((~member(D, B!5)) | member(D, C!4)))) | (~(subset(B!5, C!4) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4))))))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[17, 16])).
% 0.20/0.40 tff(19,plain,
% 0.20/0.40 (((~((~subset(B!5, C!4)) | ![D: $i] : ((~member(D, B!5)) | member(D, C!4)))) | (~(subset(B!5, C!4) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4)))))) | (subset(B!5, C!4) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4))))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(20,plain,
% 0.20/0.40 (subset(B!5, C!4) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4)))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[19, 18])).
% 0.20/0.40 tff(21,plain,
% 0.20/0.40 ((~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C))) <=> (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(22,plain,
% 0.20/0.40 ((~![B: $i, C: $i, D: $i] : ((subset(B, union(C, D)) & (intersection(B, D) = empty_set)) => subset(B, C))) <=> (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(23,axiom,(~![B: $i, C: $i, D: $i] : ((subset(B, union(C, D)) & (intersection(B, D) = empty_set)) => subset(B, C))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_th120')).
% 0.20/0.40 tff(24,plain,
% 0.20/0.40 (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[23, 22])).
% 0.20/0.40 tff(25,plain,
% 0.20/0.40 (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[24, 21])).
% 0.20/0.40 tff(26,plain,
% 0.20/0.40 (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[25, 21])).
% 0.20/0.40 tff(27,plain,
% 0.20/0.40 (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[26, 21])).
% 0.20/0.40 tff(28,plain,
% 0.20/0.40 (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[27, 21])).
% 0.20/0.41 tff(29,plain,
% 0.20/0.41 (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[28, 21])).
% 0.20/0.41 tff(30,plain,
% 0.20/0.41 (~![B: $i, C: $i, D: $i] : ((~(subset(B, union(C, D)) & (intersection(B, D) = empty_set))) | subset(B, C))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[29, 21])).
% 0.20/0.41 tff(31,plain,(
% 0.20/0.41 ~((~(subset(B!5, union(C!4, D!3)) & (intersection(B!5, D!3) = empty_set))) | subset(B!5, C!4))),
% 0.20/0.41 inference(skolemize,[status(sab)],[30])).
% 0.20/0.41 tff(32,plain,
% 0.20/0.41 (~subset(B!5, C!4)),
% 0.20/0.41 inference(or_elim,[status(thm)],[31])).
% 0.20/0.41 tff(33,plain,
% 0.20/0.41 ((~(subset(B!5, C!4) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4))))) | subset(B!5, C!4) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4)))),
% 0.20/0.41 inference(tautology,[status(thm)],[])).
% 0.20/0.41 tff(34,plain,
% 0.20/0.41 ((~(subset(B!5, C!4) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4))))) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4)))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[33, 32])).
% 0.20/0.41 tff(35,plain,
% 0.20/0.41 (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[34, 20])).
% 0.20/0.41 tff(36,plain,
% 0.20/0.41 (((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4)) | (~member(tptp_fun_D_0(C!4, B!5), C!4))),
% 0.20/0.41 inference(tautology,[status(thm)],[])).
% 0.20/0.41 tff(37,plain,
% 0.20/0.41 (~member(tptp_fun_D_0(C!4, B!5), C!4)),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[36, 35])).
% 0.20/0.41 tff(38,plain,
% 0.20/0.41 (((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4))) | member(tptp_fun_D_0(C!4, B!5), C!4)),
% 0.20/0.41 inference(tautology,[status(thm)],[])).
% 0.20/0.41 tff(39,plain,
% 0.20/0.41 ((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[38, 37])).
% 0.20/0.41 tff(40,plain,
% 0.20/0.41 (subset(B!5, union(C!4, D!3)) & (intersection(B!5, D!3) = empty_set)),
% 0.20/0.41 inference(or_elim,[status(thm)],[31])).
% 0.20/0.41 tff(41,plain,
% 0.20/0.41 (subset(B!5, union(C!4, D!3))),
% 0.20/0.41 inference(and_elim,[status(thm)],[40])).
% 0.20/0.41 tff(42,plain,
% 0.20/0.41 (^[B: $i, C: $i] : refl(((~subset(B, C)) | (intersection(B, C) = B)) <=> ((~subset(B, C)) | (intersection(B, C) = B)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(43,plain,
% 0.20/0.41 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B)) <=> ![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[42])).
% 0.20/0.41 tff(44,plain,
% 0.20/0.41 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B)) <=> ![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(45,plain,
% 0.20/0.41 (^[B: $i, C: $i] : rewrite((subset(B, C) => (intersection(B, C) = B)) <=> ((~subset(B, C)) | (intersection(B, C) = B)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(46,plain,
% 0.20/0.41 (![B: $i, C: $i] : (subset(B, C) => (intersection(B, C) = B)) <=> ![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[45])).
% 0.20/0.41 tff(47,axiom,(![B: $i, C: $i] : (subset(B, C) => (intersection(B, C) = B))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','subset_intersection')).
% 0.20/0.41 tff(48,plain,
% 0.20/0.41 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[47, 46])).
% 0.20/0.41 tff(49,plain,
% 0.20/0.41 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[48, 44])).
% 0.20/0.41 tff(50,plain,(
% 0.20/0.41 ![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.41 inference(skolemize,[status(sab)],[49])).
% 0.20/0.41 tff(51,plain,
% 0.20/0.41 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[50, 43])).
% 0.20/0.41 tff(52,plain,
% 0.20/0.41 (((~![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))) | ((~subset(B!5, union(C!4, D!3))) | (intersection(B!5, union(C!4, D!3)) = B!5))) <=> ((~![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))) | (~subset(B!5, union(C!4, D!3))) | (intersection(B!5, union(C!4, D!3)) = B!5))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(53,plain,
% 0.20/0.41 ((~![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))) | ((~subset(B!5, union(C!4, D!3))) | (intersection(B!5, union(C!4, D!3)) = B!5))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(54,plain,
% 0.20/0.41 ((~![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))) | (~subset(B!5, union(C!4, D!3))) | (intersection(B!5, union(C!4, D!3)) = B!5)),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[53, 52])).
% 0.20/0.41 tff(55,plain,
% 0.20/0.41 (intersection(B!5, union(C!4, D!3)) = B!5),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[54, 51, 41])).
% 0.20/0.41 tff(56,plain,
% 0.20/0.41 (^[B: $i, C: $i, D: $i] : refl((intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D))) <=> (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(57,plain,
% 0.20/0.41 (![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D))) <=> ![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D)))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[56])).
% 0.20/0.41 tff(58,plain,
% 0.20/0.41 (![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D))) <=> ![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D)))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(59,axiom,(![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','intersection_distributes_over_union')).
% 0.20/0.41 tff(60,plain,
% 0.20/0.41 (![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[59, 58])).
% 0.20/0.41 tff(61,plain,(
% 0.20/0.41 ![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D)))),
% 0.20/0.41 inference(skolemize,[status(sab)],[60])).
% 0.20/0.41 tff(62,plain,
% 0.20/0.41 (![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[61, 57])).
% 0.20/0.41 tff(63,plain,
% 0.20/0.41 ((~![B: $i, C: $i, D: $i] : (intersection(B, union(C, D)) = union(intersection(B, C), intersection(B, D)))) | (intersection(B!5, union(C!4, D!3)) = union(intersection(B!5, C!4), intersection(B!5, D!3)))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(64,plain,
% 0.20/0.41 (intersection(B!5, union(C!4, D!3)) = union(intersection(B!5, C!4), intersection(B!5, D!3))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[63, 62])).
% 0.20/0.41 tff(65,plain,
% 0.20/0.41 (union(intersection(B!5, C!4), intersection(B!5, D!3)) = intersection(B!5, union(C!4, D!3))),
% 0.20/0.41 inference(symmetry,[status(thm)],[64])).
% 0.20/0.41 tff(66,plain,
% 0.20/0.41 (intersection(B!5, D!3) = empty_set),
% 0.20/0.41 inference(and_elim,[status(thm)],[40])).
% 0.20/0.41 tff(67,plain,
% 0.20/0.41 (empty_set = intersection(B!5, D!3)),
% 0.20/0.41 inference(symmetry,[status(thm)],[66])).
% 0.20/0.41 tff(68,plain,
% 0.20/0.41 (union(intersection(B!5, C!4), empty_set) = union(intersection(B!5, C!4), intersection(B!5, D!3))),
% 0.20/0.41 inference(monotonicity,[status(thm)],[67])).
% 0.20/0.41 tff(69,plain,
% 0.20/0.41 (^[B: $i] : refl((union(B, empty_set) = B) <=> (union(B, empty_set) = B))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(70,plain,
% 0.20/0.41 (![B: $i] : (union(B, empty_set) = B) <=> ![B: $i] : (union(B, empty_set) = B)),
% 0.20/0.41 inference(quant_intro,[status(thm)],[69])).
% 0.20/0.41 tff(71,plain,
% 0.20/0.41 (![B: $i] : (union(B, empty_set) = B) <=> ![B: $i] : (union(B, empty_set) = B)),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(72,axiom,(![B: $i] : (union(B, empty_set) = B)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','union_empty_set')).
% 0.20/0.41 tff(73,plain,
% 0.20/0.41 (![B: $i] : (union(B, empty_set) = B)),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[72, 71])).
% 0.20/0.41 tff(74,plain,(
% 0.20/0.41 ![B: $i] : (union(B, empty_set) = B)),
% 0.20/0.41 inference(skolemize,[status(sab)],[73])).
% 0.20/0.41 tff(75,plain,
% 0.20/0.41 (![B: $i] : (union(B, empty_set) = B)),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[74, 70])).
% 0.20/0.41 tff(76,plain,
% 0.20/0.41 ((~![B: $i] : (union(B, empty_set) = B)) | (union(intersection(B!5, C!4), empty_set) = intersection(B!5, C!4))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(77,plain,
% 0.20/0.41 (union(intersection(B!5, C!4), empty_set) = intersection(B!5, C!4)),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[76, 75])).
% 0.20/0.41 tff(78,plain,
% 0.20/0.41 (intersection(B!5, C!4) = union(intersection(B!5, C!4), empty_set)),
% 0.20/0.41 inference(symmetry,[status(thm)],[77])).
% 0.20/0.41 tff(79,plain,
% 0.20/0.41 (intersection(B!5, C!4) = B!5),
% 0.20/0.41 inference(transitivity,[status(thm)],[78, 68, 65, 55])).
% 0.20/0.41 tff(80,plain,
% 0.20/0.41 (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> member(tptp_fun_D_0(C!4, B!5), B!5)),
% 0.20/0.41 inference(monotonicity,[status(thm)],[79])).
% 0.20/0.41 tff(81,plain,
% 0.20/0.41 (member(tptp_fun_D_0(C!4, B!5), B!5) <=> member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4))),
% 0.20/0.41 inference(symmetry,[status(thm)],[80])).
% 0.20/0.41 tff(82,plain,
% 0.20/0.41 (((~member(tptp_fun_D_0(C!4, B!5), B!5)) | member(tptp_fun_D_0(C!4, B!5), C!4)) | member(tptp_fun_D_0(C!4, B!5), B!5)),
% 0.20/0.41 inference(tautology,[status(thm)],[])).
% 0.20/0.41 tff(83,plain,
% 0.20/0.41 (member(tptp_fun_D_0(C!4, B!5), B!5)),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[82, 35])).
% 0.20/0.41 tff(84,plain,
% 0.20/0.41 (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[83, 81])).
% 0.20/0.41 tff(85,plain,
% 0.20/0.41 ((~(member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4)))))) | (~member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4))) | (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4))))),
% 0.20/0.41 inference(tautology,[status(thm)],[])).
% 0.20/0.41 tff(86,plain,
% 0.20/0.41 (~(member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4)))))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[85, 84, 39])).
% 0.20/0.41 tff(87,plain,
% 0.20/0.41 (^[B: $i, C: $i, D: $i] : refl((member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B))))) <=> (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B))))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(88,plain,
% 0.20/0.41 (![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B))))) <=> ![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[87])).
% 0.20/0.41 tff(89,plain,
% 0.20/0.41 (^[B: $i, C: $i, D: $i] : rewrite((member(D, intersection(B, C)) <=> (member(D, B) & member(D, C))) <=> (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B))))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(90,plain,
% 0.20/0.41 (![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (member(D, B) & member(D, C))) <=> ![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[89])).
% 0.20/0.41 tff(91,plain,
% 0.20/0.41 (![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (member(D, B) & member(D, C))) <=> ![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (member(D, B) & member(D, C)))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(92,axiom,(![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (member(D, B) & member(D, C)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','intersection_defn')).
% 0.20/0.42 tff(93,plain,
% 0.20/0.42 (![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (member(D, B) & member(D, C)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[92, 91])).
% 0.20/0.42 tff(94,plain,(
% 0.20/0.42 ![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (member(D, B) & member(D, C)))),
% 0.20/0.42 inference(skolemize,[status(sab)],[93])).
% 0.20/0.42 tff(95,plain,
% 0.20/0.42 (![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[94, 90])).
% 0.20/0.42 tff(96,plain,
% 0.20/0.42 (![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[95, 88])).
% 0.20/0.42 tff(97,plain,
% 0.20/0.42 (((~![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))) | (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4)))))) <=> ((~![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))) | (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4))))))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(98,plain,
% 0.20/0.42 ((member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), C!4)) | (~member(tptp_fun_D_0(C!4, B!5), B!5))))) <=> (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4)))))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(99,plain,
% 0.20/0.42 (((~![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))) | (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), C!4)) | (~member(tptp_fun_D_0(C!4, B!5), B!5)))))) <=> ((~![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))) | (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4))))))),
% 0.20/0.42 inference(monotonicity,[status(thm)],[98])).
% 0.20/0.42 tff(100,plain,
% 0.20/0.42 (((~![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))) | (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), C!4)) | (~member(tptp_fun_D_0(C!4, B!5), B!5)))))) <=> ((~![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))) | (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4))))))),
% 0.20/0.42 inference(transitivity,[status(thm)],[99, 97])).
% 0.20/0.42 tff(101,plain,
% 0.20/0.42 ((~![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))) | (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), C!4)) | (~member(tptp_fun_D_0(C!4, B!5), B!5)))))),
% 0.20/0.42 inference(quant_inst,[status(thm)],[])).
% 0.20/0.42 tff(102,plain,
% 0.20/0.42 ((~![B: $i, C: $i, D: $i] : (member(D, intersection(B, C)) <=> (~((~member(D, C)) | (~member(D, B)))))) | (member(tptp_fun_D_0(C!4, B!5), intersection(B!5, C!4)) <=> (~((~member(tptp_fun_D_0(C!4, B!5), B!5)) | (~member(tptp_fun_D_0(C!4, B!5), C!4)))))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[101, 100])).
% 0.20/0.42 tff(103,plain,
% 0.20/0.42 ($false),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[102, 96, 86])).
% 0.20/0.42 % SZS output end Proof
%------------------------------------------------------------------------------