TSTP Solution File: SEU140+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% 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 : Tue Sep 20 07:27:42 EDT 2022
% Result : Theorem 0.13s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n006.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 09:37:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.13/0.41 % SZS status Theorem
% 0.13/0.41 % SZS output start Proof
% 0.13/0.41 tff(subset_type, type, (
% 0.13/0.41 subset: ( $i * $i ) > $o)).
% 0.13/0.41 tff(empty_set_type, type, (
% 0.13/0.41 empty_set: $i)).
% 0.13/0.41 tff(set_intersection2_type, type, (
% 0.13/0.41 set_intersection2: ( $i * $i ) > $i)).
% 0.13/0.41 tff(tptp_fun_A_4_type, type, (
% 0.13/0.41 tptp_fun_A_4: $i)).
% 0.13/0.41 tff(tptp_fun_C_2_type, type, (
% 0.13/0.41 tptp_fun_C_2: $i)).
% 0.13/0.41 tff(tptp_fun_B_3_type, type, (
% 0.13/0.41 tptp_fun_B_3: $i)).
% 0.13/0.41 tff(disjoint_type, type, (
% 0.13/0.41 disjoint: ( $i * $i ) > $o)).
% 0.13/0.41 tff(1,plain,
% 0.13/0.41 (^[A: $i, B: $i] : refl((disjoint(A, B) <=> (set_intersection2(A, B) = empty_set)) <=> (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set)))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(2,plain,
% 0.13/0.41 (![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set)) <=> ![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[1])).
% 0.13/0.41 tff(3,plain,
% 0.13/0.41 (![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set)) <=> ![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(4,axiom,(![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','d7_xboole_0')).
% 0.13/0.41 tff(5,plain,
% 0.13/0.41 (![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.13/0.41 tff(6,plain,(
% 0.13/0.41 ![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set))),
% 0.13/0.41 inference(skolemize,[status(sab)],[5])).
% 0.13/0.41 tff(7,plain,
% 0.13/0.41 (![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.13/0.41 tff(8,plain,
% 0.13/0.41 ((~![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set))) | (disjoint(B!3, C!2) <=> (set_intersection2(B!3, C!2) = empty_set))),
% 0.13/0.41 inference(quant_inst,[status(thm)],[])).
% 0.13/0.41 tff(9,plain,
% 0.13/0.41 (disjoint(B!3, C!2) <=> (set_intersection2(B!3, C!2) = empty_set)),
% 0.13/0.41 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.13/0.41 tff(10,plain,
% 0.13/0.41 ((~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C))) <=> (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C)))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(11,plain,
% 0.13/0.41 ((~![A: $i, B: $i, C: $i] : ((subset(A, B) & disjoint(B, C)) => disjoint(A, C))) <=> (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C)))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(12,axiom,(~![A: $i, B: $i, C: $i] : ((subset(A, B) & disjoint(B, C)) => disjoint(A, C))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t63_xboole_1')).
% 0.13/0.41 tff(13,plain,
% 0.13/0.41 (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[12, 11])).
% 0.13/0.41 tff(14,plain,
% 0.13/0.41 (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[13, 10])).
% 0.13/0.41 tff(15,plain,
% 0.13/0.41 (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[14, 10])).
% 0.13/0.41 tff(16,plain,
% 0.13/0.41 (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[15, 10])).
% 0.13/0.41 tff(17,plain,
% 0.13/0.41 (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[16, 10])).
% 0.13/0.41 tff(18,plain,
% 0.13/0.41 (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[17, 10])).
% 0.13/0.41 tff(19,plain,
% 0.13/0.41 (~![A: $i, B: $i, C: $i] : ((~(subset(A, B) & disjoint(B, C))) | disjoint(A, C))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[18, 10])).
% 0.13/0.41 tff(20,plain,(
% 0.13/0.41 ~((~(subset(A!4, B!3) & disjoint(B!3, C!2))) | disjoint(A!4, C!2))),
% 0.13/0.41 inference(skolemize,[status(sab)],[19])).
% 0.13/0.41 tff(21,plain,
% 0.13/0.41 (subset(A!4, B!3) & disjoint(B!3, C!2)),
% 0.13/0.41 inference(or_elim,[status(thm)],[20])).
% 0.13/0.41 tff(22,plain,
% 0.13/0.41 (disjoint(B!3, C!2)),
% 0.13/0.41 inference(and_elim,[status(thm)],[21])).
% 0.13/0.41 tff(23,plain,
% 0.13/0.41 ((~(disjoint(B!3, C!2) <=> (set_intersection2(B!3, C!2) = empty_set))) | (~disjoint(B!3, C!2)) | (set_intersection2(B!3, C!2) = empty_set)),
% 0.13/0.41 inference(tautology,[status(thm)],[])).
% 0.13/0.41 tff(24,plain,
% 0.13/0.41 ((~(disjoint(B!3, C!2) <=> (set_intersection2(B!3, C!2) = empty_set))) | (set_intersection2(B!3, C!2) = empty_set)),
% 0.13/0.41 inference(unit_resolution,[status(thm)],[23, 22])).
% 0.13/0.41 tff(25,plain,
% 0.13/0.41 (set_intersection2(B!3, C!2) = empty_set),
% 0.13/0.41 inference(unit_resolution,[status(thm)],[24, 9])).
% 0.13/0.41 tff(26,plain,
% 0.13/0.41 (empty_set = set_intersection2(B!3, C!2)),
% 0.13/0.41 inference(symmetry,[status(thm)],[25])).
% 0.13/0.41 tff(27,plain,
% 0.13/0.41 (^[A: $i, B: $i] : refl((set_intersection2(A, B) = set_intersection2(B, A)) <=> (set_intersection2(A, B) = set_intersection2(B, A)))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(28,plain,
% 0.13/0.41 (![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A)) <=> ![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[27])).
% 0.13/0.41 tff(29,plain,
% 0.13/0.41 (![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A)) <=> ![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(30,axiom,(![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','commutativity_k3_xboole_0')).
% 0.13/0.41 tff(31,plain,
% 0.13/0.41 (![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[30, 29])).
% 0.13/0.41 tff(32,plain,(
% 0.13/0.41 ![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A))),
% 0.13/0.41 inference(skolemize,[status(sab)],[31])).
% 0.13/0.41 tff(33,plain,
% 0.13/0.41 (![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[32, 28])).
% 0.13/0.41 tff(34,plain,
% 0.13/0.41 ((~![A: $i, B: $i] : (set_intersection2(A, B) = set_intersection2(B, A))) | (set_intersection2(A!4, C!2) = set_intersection2(C!2, A!4))),
% 0.13/0.41 inference(quant_inst,[status(thm)],[])).
% 0.13/0.41 tff(35,plain,
% 0.13/0.41 (set_intersection2(A!4, C!2) = set_intersection2(C!2, A!4)),
% 0.13/0.41 inference(unit_resolution,[status(thm)],[34, 33])).
% 0.13/0.41 tff(36,plain,
% 0.13/0.41 (set_intersection2(C!2, A!4) = set_intersection2(A!4, C!2)),
% 0.13/0.41 inference(symmetry,[status(thm)],[35])).
% 0.13/0.41 tff(37,plain,
% 0.13/0.41 (subset(set_intersection2(C!2, A!4), empty_set) <=> subset(set_intersection2(A!4, C!2), set_intersection2(B!3, C!2))),
% 0.13/0.41 inference(monotonicity,[status(thm)],[36, 26])).
% 0.13/0.41 tff(38,plain,
% 0.13/0.41 (subset(set_intersection2(A!4, C!2), set_intersection2(B!3, C!2)) <=> subset(set_intersection2(C!2, A!4), empty_set)),
% 0.13/0.41 inference(symmetry,[status(thm)],[37])).
% 0.13/0.41 tff(39,plain,
% 0.13/0.41 (subset(A!4, B!3)),
% 0.13/0.41 inference(and_elim,[status(thm)],[21])).
% 0.13/0.41 tff(40,plain,
% 0.13/0.41 (^[A: $i, B: $i, C: $i] : refl(((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C))) <=> ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C))))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(41,plain,
% 0.13/0.41 (![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C))) <=> ![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[40])).
% 0.13/0.41 tff(42,plain,
% 0.13/0.41 (![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C))) <=> ![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(43,plain,
% 0.13/0.41 (^[A: $i, B: $i, C: $i] : rewrite((subset(A, B) => subset(set_intersection2(A, C), set_intersection2(B, C))) <=> ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C))))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(44,plain,
% 0.13/0.41 (![A: $i, B: $i, C: $i] : (subset(A, B) => subset(set_intersection2(A, C), set_intersection2(B, C))) <=> ![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[43])).
% 0.13/0.41 tff(45,axiom,(![A: $i, B: $i, C: $i] : (subset(A, B) => subset(set_intersection2(A, C), set_intersection2(B, C)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t26_xboole_1')).
% 0.13/0.41 tff(46,plain,
% 0.13/0.41 (![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[45, 44])).
% 0.13/0.41 tff(47,plain,
% 0.13/0.41 (![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[46, 42])).
% 0.13/0.41 tff(48,plain,(
% 0.13/0.41 ![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))),
% 0.13/0.41 inference(skolemize,[status(sab)],[47])).
% 0.13/0.41 tff(49,plain,
% 0.13/0.41 (![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[48, 41])).
% 0.13/0.41 tff(50,plain,
% 0.13/0.41 (((~![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))) | ((~subset(A!4, B!3)) | subset(set_intersection2(A!4, C!2), set_intersection2(B!3, C!2)))) <=> ((~![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))) | (~subset(A!4, B!3)) | subset(set_intersection2(A!4, C!2), set_intersection2(B!3, C!2)))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(51,plain,
% 0.13/0.41 ((~![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))) | ((~subset(A!4, B!3)) | subset(set_intersection2(A!4, C!2), set_intersection2(B!3, C!2)))),
% 0.13/0.41 inference(quant_inst,[status(thm)],[])).
% 0.13/0.41 tff(52,plain,
% 0.13/0.41 ((~![A: $i, B: $i, C: $i] : ((~subset(A, B)) | subset(set_intersection2(A, C), set_intersection2(B, C)))) | (~subset(A!4, B!3)) | subset(set_intersection2(A!4, C!2), set_intersection2(B!3, C!2))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[51, 50])).
% 0.13/0.41 tff(53,plain,
% 0.13/0.41 (subset(set_intersection2(A!4, C!2), set_intersection2(B!3, C!2))),
% 0.13/0.41 inference(unit_resolution,[status(thm)],[52, 49, 39])).
% 0.13/0.41 tff(54,plain,
% 0.13/0.41 (subset(set_intersection2(C!2, A!4), empty_set)),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[53, 38])).
% 0.13/0.41 tff(55,plain,
% 0.13/0.41 ((~![A: $i, B: $i] : (disjoint(A, B) <=> (set_intersection2(A, B) = empty_set))) | (disjoint(C!2, A!4) <=> (set_intersection2(C!2, A!4) = empty_set))),
% 0.13/0.41 inference(quant_inst,[status(thm)],[])).
% 0.13/0.41 tff(56,plain,
% 0.13/0.41 (disjoint(C!2, A!4) <=> (set_intersection2(C!2, A!4) = empty_set)),
% 0.13/0.41 inference(unit_resolution,[status(thm)],[55, 7])).
% 0.13/0.41 tff(57,plain,
% 0.13/0.41 (~disjoint(A!4, C!2)),
% 0.13/0.41 inference(or_elim,[status(thm)],[20])).
% 0.13/0.41 tff(58,plain,
% 0.13/0.41 (^[A: $i, B: $i] : refl(((~disjoint(A, B)) | disjoint(B, A)) <=> ((~disjoint(A, B)) | disjoint(B, A)))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(59,plain,
% 0.13/0.41 (![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A)) <=> ![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[58])).
% 0.13/0.41 tff(60,plain,
% 0.13/0.41 (![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A)) <=> ![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(61,plain,
% 0.13/0.41 (^[A: $i, B: $i] : rewrite((disjoint(A, B) => disjoint(B, A)) <=> ((~disjoint(A, B)) | disjoint(B, A)))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(62,plain,
% 0.13/0.41 (![A: $i, B: $i] : (disjoint(A, B) => disjoint(B, A)) <=> ![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[61])).
% 0.13/0.41 tff(63,axiom,(![A: $i, B: $i] : (disjoint(A, B) => disjoint(B, A))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','symmetry_r1_xboole_0')).
% 0.13/0.41 tff(64,plain,
% 0.13/0.41 (![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[63, 62])).
% 0.13/0.41 tff(65,plain,
% 0.13/0.41 (![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[64, 60])).
% 0.13/0.41 tff(66,plain,(
% 0.13/0.41 ![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))),
% 0.13/0.41 inference(skolemize,[status(sab)],[65])).
% 0.13/0.41 tff(67,plain,
% 0.13/0.41 (![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[66, 59])).
% 0.13/0.41 tff(68,plain,
% 0.13/0.41 (((~![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))) | ((~disjoint(C!2, A!4)) | disjoint(A!4, C!2))) <=> ((~![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))) | (~disjoint(C!2, A!4)) | disjoint(A!4, C!2))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(69,plain,
% 0.20/0.42 ((~![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))) | ((~disjoint(C!2, A!4)) | disjoint(A!4, C!2))),
% 0.20/0.42 inference(quant_inst,[status(thm)],[])).
% 0.20/0.42 tff(70,plain,
% 0.20/0.42 ((~![A: $i, B: $i] : ((~disjoint(A, B)) | disjoint(B, A))) | (~disjoint(C!2, A!4)) | disjoint(A!4, C!2)),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[69, 68])).
% 0.20/0.42 tff(71,plain,
% 0.20/0.42 (~disjoint(C!2, A!4)),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[70, 67, 57])).
% 0.20/0.42 tff(72,plain,
% 0.20/0.42 ((~(disjoint(C!2, A!4) <=> (set_intersection2(C!2, A!4) = empty_set))) | disjoint(C!2, A!4) | (~(set_intersection2(C!2, A!4) = empty_set))),
% 0.20/0.42 inference(tautology,[status(thm)],[])).
% 0.20/0.42 tff(73,plain,
% 0.20/0.42 ((~(disjoint(C!2, A!4) <=> (set_intersection2(C!2, A!4) = empty_set))) | (~(set_intersection2(C!2, A!4) = empty_set))),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[72, 71])).
% 0.20/0.42 tff(74,plain,
% 0.20/0.42 (~(set_intersection2(C!2, A!4) = empty_set)),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[73, 56])).
% 0.20/0.42 tff(75,plain,
% 0.20/0.42 (^[A: $i] : refl(((~subset(A, empty_set)) | (A = empty_set)) <=> ((~subset(A, empty_set)) | (A = empty_set)))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(76,plain,
% 0.20/0.42 (![A: $i] : ((~subset(A, empty_set)) | (A = empty_set)) <=> ![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[75])).
% 0.20/0.42 tff(77,plain,
% 0.20/0.42 (![A: $i] : ((~subset(A, empty_set)) | (A = empty_set)) <=> ![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(78,plain,
% 0.20/0.42 (^[A: $i] : rewrite((subset(A, empty_set) => (A = empty_set)) <=> ((~subset(A, empty_set)) | (A = empty_set)))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(79,plain,
% 0.20/0.42 (![A: $i] : (subset(A, empty_set) => (A = empty_set)) <=> ![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[78])).
% 0.20/0.42 tff(80,axiom,(![A: $i] : (subset(A, empty_set) => (A = empty_set))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t3_xboole_1')).
% 0.20/0.42 tff(81,plain,
% 0.20/0.42 (![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[80, 79])).
% 0.20/0.42 tff(82,plain,
% 0.20/0.42 (![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[81, 77])).
% 0.20/0.42 tff(83,plain,(
% 0.20/0.42 ![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))),
% 0.20/0.42 inference(skolemize,[status(sab)],[82])).
% 0.20/0.42 tff(84,plain,
% 0.20/0.42 (![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[83, 76])).
% 0.20/0.42 tff(85,plain,
% 0.20/0.42 (((~![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))) | ((~subset(set_intersection2(C!2, A!4), empty_set)) | (set_intersection2(C!2, A!4) = empty_set))) <=> ((~![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))) | (~subset(set_intersection2(C!2, A!4), empty_set)) | (set_intersection2(C!2, A!4) = empty_set))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(86,plain,
% 0.20/0.42 ((~![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))) | ((~subset(set_intersection2(C!2, A!4), empty_set)) | (set_intersection2(C!2, A!4) = empty_set))),
% 0.20/0.42 inference(quant_inst,[status(thm)],[])).
% 0.20/0.42 tff(87,plain,
% 0.20/0.42 ((~![A: $i] : ((~subset(A, empty_set)) | (A = empty_set))) | (~subset(set_intersection2(C!2, A!4), empty_set)) | (set_intersection2(C!2, A!4) = empty_set)),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[86, 85])).
% 0.20/0.42 tff(88,plain,
% 0.20/0.42 (~subset(set_intersection2(C!2, A!4), empty_set)),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[87, 84, 74])).
% 0.20/0.42 tff(89,plain,
% 0.20/0.42 ($false),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[88, 54])).
% 0.20/0.42 % SZS output end Proof
%------------------------------------------------------------------------------