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