TSTP Solution File: SET585+3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET585+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n023.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:08 EDT 2022
% Result : Theorem 0.18s 0.38s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET585+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Sep 3 07:09:33 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.33 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.33 Usage: tptp [options] [-file:]file
% 0.13/0.33 -h, -? prints this message.
% 0.13/0.33 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.33 -m, -model generate model.
% 0.13/0.33 -p, -proof generate proof.
% 0.13/0.33 -c, -core generate unsat core of named formulas.
% 0.13/0.33 -st, -statistics display statistics.
% 0.13/0.33 -t:timeout set timeout (in second).
% 0.13/0.33 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.33 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.33 -<param>:<value> configuration parameter and value.
% 0.13/0.33 -o:<output-file> file to place output in.
% 0.18/0.38 % SZS status Theorem
% 0.18/0.38 % SZS output start Proof
% 0.18/0.38 tff(subset_type, type, (
% 0.18/0.38 subset: ( $i * $i ) > $o)).
% 0.18/0.38 tff(tptp_fun_B_4_type, type, (
% 0.18/0.38 tptp_fun_B_4: $i)).
% 0.18/0.38 tff(intersection_type, type, (
% 0.18/0.38 intersection: ( $i * $i ) > $i)).
% 0.18/0.38 tff(tptp_fun_C_3_type, type, (
% 0.18/0.38 tptp_fun_C_3: $i)).
% 0.18/0.38 tff(union_type, type, (
% 0.18/0.38 union: ( $i * $i ) > $i)).
% 0.18/0.38 tff(tptp_fun_D_2_type, type, (
% 0.18/0.38 tptp_fun_D_2: $i)).
% 0.18/0.38 tff(1,plain,
% 0.18/0.38 (^[B: $i, C: $i] : refl(subset(intersection(B, C), B) <=> subset(intersection(B, C), B))),
% 0.18/0.38 inference(bind,[status(th)],[])).
% 0.18/0.38 tff(2,plain,
% 0.18/0.38 (![B: $i, C: $i] : subset(intersection(B, C), B) <=> ![B: $i, C: $i] : subset(intersection(B, C), B)),
% 0.18/0.38 inference(quant_intro,[status(thm)],[1])).
% 0.18/0.38 tff(3,plain,
% 0.18/0.38 (![B: $i, C: $i] : subset(intersection(B, C), B) <=> ![B: $i, C: $i] : subset(intersection(B, C), B)),
% 0.18/0.38 inference(rewrite,[status(thm)],[])).
% 0.18/0.38 tff(4,axiom,(![B: $i, C: $i] : subset(intersection(B, C), B)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','intersection_is_subset')).
% 0.18/0.38 tff(5,plain,
% 0.18/0.38 (![B: $i, C: $i] : subset(intersection(B, C), B)),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.18/0.38 tff(6,plain,(
% 0.18/0.38 ![B: $i, C: $i] : subset(intersection(B, C), B)),
% 0.18/0.38 inference(skolemize,[status(sab)],[5])).
% 0.18/0.38 tff(7,plain,
% 0.18/0.38 (![B: $i, C: $i] : subset(intersection(B, C), B)),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.18/0.38 tff(8,plain,
% 0.18/0.38 ((~![B: $i, C: $i] : subset(intersection(B, C), B)) | subset(intersection(B!4, C!3), B!4)),
% 0.18/0.38 inference(quant_inst,[status(thm)],[])).
% 0.18/0.38 tff(9,plain,
% 0.18/0.38 (subset(intersection(B!4, C!3), B!4)),
% 0.18/0.38 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.18/0.38 tff(10,plain,
% 0.18/0.38 (^[B: $i, C: $i] : refl(subset(B, union(B, C)) <=> subset(B, union(B, C)))),
% 0.18/0.38 inference(bind,[status(th)],[])).
% 0.18/0.38 tff(11,plain,
% 0.18/0.38 (![B: $i, C: $i] : subset(B, union(B, C)) <=> ![B: $i, C: $i] : subset(B, union(B, C))),
% 0.18/0.38 inference(quant_intro,[status(thm)],[10])).
% 0.18/0.38 tff(12,plain,
% 0.18/0.38 (![B: $i, C: $i] : subset(B, union(B, C)) <=> ![B: $i, C: $i] : subset(B, union(B, C))),
% 0.18/0.38 inference(rewrite,[status(thm)],[])).
% 0.18/0.38 tff(13,axiom,(![B: $i, C: $i] : subset(B, union(B, C))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','subset_of_union')).
% 0.18/0.38 tff(14,plain,
% 0.18/0.38 (![B: $i, C: $i] : subset(B, union(B, C))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.18/0.38 tff(15,plain,(
% 0.18/0.38 ![B: $i, C: $i] : subset(B, union(B, C))),
% 0.18/0.38 inference(skolemize,[status(sab)],[14])).
% 0.18/0.38 tff(16,plain,
% 0.18/0.38 (![B: $i, C: $i] : subset(B, union(B, C))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[15, 11])).
% 0.18/0.38 tff(17,plain,
% 0.18/0.38 ((~![B: $i, C: $i] : subset(B, union(B, C))) | subset(B!4, union(B!4, D!2))),
% 0.18/0.38 inference(quant_inst,[status(thm)],[])).
% 0.18/0.38 tff(18,plain,
% 0.18/0.38 (subset(B!4, union(B!4, D!2))),
% 0.18/0.38 inference(unit_resolution,[status(thm)],[17, 16])).
% 0.18/0.38 tff(19,plain,
% 0.18/0.38 ((~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))) <=> (~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D)))),
% 0.18/0.38 inference(rewrite,[status(thm)],[])).
% 0.18/0.38 tff(20,axiom,(~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_intersection_subset_of_union')).
% 0.18/0.38 tff(21,plain,
% 0.18/0.38 (~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[20, 19])).
% 0.18/0.38 tff(22,plain,
% 0.18/0.38 (~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[21, 19])).
% 0.18/0.38 tff(23,plain,
% 0.18/0.38 (~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[22, 19])).
% 0.18/0.38 tff(24,plain,
% 0.18/0.38 (~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[23, 19])).
% 0.18/0.38 tff(25,plain,
% 0.18/0.38 (~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[24, 19])).
% 0.18/0.38 tff(26,plain,
% 0.18/0.38 (~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[25, 19])).
% 0.18/0.38 tff(27,plain,
% 0.18/0.38 (~![B: $i, C: $i, D: $i] : subset(intersection(B, C), union(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[26, 19])).
% 0.18/0.38 tff(28,plain,(
% 0.18/0.38 ~subset(intersection(B!4, C!3), union(B!4, D!2))),
% 0.18/0.38 inference(skolemize,[status(sab)],[27])).
% 0.18/0.38 tff(29,plain,
% 0.18/0.38 (![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C))) <=> ![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))),
% 0.18/0.38 inference(rewrite,[status(thm)],[])).
% 0.18/0.38 tff(30,plain,
% 0.18/0.38 (^[B: $i, C: $i, D: $i] : trans(monotonicity(trans(monotonicity(rewrite((subset(B, C) & subset(C, D)) <=> (~((~subset(C, D)) | (~subset(B, C))))), ((~(subset(B, C) & subset(C, D))) <=> (~(~((~subset(C, D)) | (~subset(B, C))))))), rewrite((~(~((~subset(C, D)) | (~subset(B, C))))) <=> ((~subset(C, D)) | (~subset(B, C)))), ((~(subset(B, C) & subset(C, D))) <=> ((~subset(C, D)) | (~subset(B, C))))), (((~(subset(B, C) & subset(C, D))) | subset(B, D)) <=> (((~subset(C, D)) | (~subset(B, C))) | subset(B, D)))), rewrite((((~subset(C, D)) | (~subset(B, C))) | subset(B, D)) <=> (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))), (((~(subset(B, C) & subset(C, D))) | subset(B, D)) <=> (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))))),
% 0.18/0.38 inference(bind,[status(th)],[])).
% 0.18/0.38 tff(31,plain,
% 0.18/0.38 (![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(C, D))) | subset(B, D)) <=> ![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))),
% 0.18/0.38 inference(quant_intro,[status(thm)],[30])).
% 0.18/0.38 tff(32,plain,
% 0.18/0.38 (![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(C, D))) | subset(B, D)) <=> ![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(C, D))) | subset(B, D))),
% 0.18/0.38 inference(rewrite,[status(thm)],[])).
% 0.18/0.38 tff(33,plain,
% 0.18/0.38 (^[B: $i, C: $i, D: $i] : rewrite(((subset(B, C) & subset(C, D)) => subset(B, D)) <=> ((~(subset(B, C) & subset(C, D))) | subset(B, D)))),
% 0.18/0.38 inference(bind,[status(th)],[])).
% 0.18/0.38 tff(34,plain,
% 0.18/0.38 (![B: $i, C: $i, D: $i] : ((subset(B, C) & subset(C, D)) => subset(B, D)) <=> ![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(C, D))) | subset(B, D))),
% 0.18/0.38 inference(quant_intro,[status(thm)],[33])).
% 0.18/0.38 tff(35,axiom,(![B: $i, C: $i, D: $i] : ((subset(B, C) & subset(C, D)) => subset(B, D))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','transitivity_of_subset')).
% 0.18/0.38 tff(36,plain,
% 0.18/0.38 (![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(C, D))) | subset(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[35, 34])).
% 0.18/0.38 tff(37,plain,
% 0.18/0.38 (![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(C, D))) | subset(B, D))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[36, 32])).
% 0.18/0.38 tff(38,plain,(
% 0.18/0.38 ![B: $i, C: $i, D: $i] : ((~(subset(B, C) & subset(C, D))) | subset(B, D))),
% 0.18/0.38 inference(skolemize,[status(sab)],[37])).
% 0.18/0.38 tff(39,plain,
% 0.18/0.38 (![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[38, 31])).
% 0.18/0.38 tff(40,plain,
% 0.18/0.38 (![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[39, 29])).
% 0.18/0.38 tff(41,plain,
% 0.18/0.38 (((~![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))) | (subset(intersection(B!4, C!3), union(B!4, D!2)) | (~subset(B!4, union(B!4, D!2))) | (~subset(intersection(B!4, C!3), B!4)))) <=> ((~![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))) | subset(intersection(B!4, C!3), union(B!4, D!2)) | (~subset(B!4, union(B!4, D!2))) | (~subset(intersection(B!4, C!3), B!4)))),
% 0.18/0.38 inference(rewrite,[status(thm)],[])).
% 0.18/0.38 tff(42,plain,
% 0.18/0.38 ((~![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))) | (subset(intersection(B!4, C!3), union(B!4, D!2)) | (~subset(B!4, union(B!4, D!2))) | (~subset(intersection(B!4, C!3), B!4)))),
% 0.18/0.38 inference(quant_inst,[status(thm)],[])).
% 0.18/0.38 tff(43,plain,
% 0.18/0.38 ((~![B: $i, C: $i, D: $i] : (subset(B, D) | (~subset(C, D)) | (~subset(B, C)))) | subset(intersection(B!4, C!3), union(B!4, D!2)) | (~subset(B!4, union(B!4, D!2))) | (~subset(intersection(B!4, C!3), B!4))),
% 0.18/0.38 inference(modus_ponens,[status(thm)],[42, 41])).
% 0.18/0.38 tff(44,plain,
% 0.18/0.38 ($false),
% 0.18/0.38 inference(unit_resolution,[status(thm)],[43, 40, 28, 18, 9])).
% 0.18/0.38 % SZS output end Proof
%------------------------------------------------------------------------------