TSTP Solution File: SET574+3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET574+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n001.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:04 EDT 2022
% Result : Theorem 0.13s 0.31s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET574+3 : TPTP v8.1.0. Released v2.2.0.
% 0.02/0.10 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.08/0.29 % Computer : n001.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Sat Sep 3 07:06:40 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.08/0.29 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.08/0.29 Usage: tptp [options] [-file:]file
% 0.08/0.29 -h, -? prints this message.
% 0.08/0.29 -smt2 print SMT-LIB2 benchmark.
% 0.08/0.29 -m, -model generate model.
% 0.08/0.29 -p, -proof generate proof.
% 0.08/0.29 -c, -core generate unsat core of named formulas.
% 0.08/0.29 -st, -statistics display statistics.
% 0.08/0.29 -t:timeout set timeout (in second).
% 0.08/0.29 -smt2status display status in smt2 format instead of SZS.
% 0.08/0.29 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.08/0.29 -<param>:<value> configuration parameter and value.
% 0.08/0.29 -o:<output-file> file to place output in.
% 0.13/0.31 % SZS status Theorem
% 0.13/0.31 % SZS output start Proof
% 0.13/0.31 tff(member_type, type, (
% 0.13/0.31 member: ( $i * $i ) > $o)).
% 0.13/0.31 tff(tptp_fun_D_1_type, type, (
% 0.13/0.31 tptp_fun_D_1: $i)).
% 0.13/0.31 tff(tptp_fun_C_2_type, type, (
% 0.13/0.31 tptp_fun_C_2: $i)).
% 0.13/0.31 tff(intersect_type, type, (
% 0.13/0.31 intersect: ( $i * $i ) > $o)).
% 0.13/0.31 tff(tptp_fun_D_0_type, type, (
% 0.13/0.31 tptp_fun_D_0: ( $i * $i ) > $i)).
% 0.13/0.31 tff(tptp_fun_B_3_type, type, (
% 0.13/0.31 tptp_fun_B_3: $i)).
% 0.13/0.31 tff(1,plain,
% 0.13/0.31 (^[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, 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, B)) | (~member(D, C))))))))),
% 0.13/0.31 inference(bind,[status(th)],[])).
% 0.13/0.31 tff(2,plain,
% 0.13/0.31 (![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, B)) | (~member(D, C)))))))),
% 0.13/0.31 inference(quant_intro,[status(thm)],[1])).
% 0.13/0.31 tff(3,plain,
% 0.13/0.31 (^[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, 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, B)) | (~member(D, C))))))))),
% 0.13/0.31 inference(bind,[status(th)],[])).
% 0.13/0.31 tff(4,plain,
% 0.13/0.31 (![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, B)) | (~member(D, C)))))))),
% 0.13/0.31 inference(quant_intro,[status(thm)],[3])).
% 0.13/0.31 tff(5,plain,
% 0.13/0.31 (![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, B)) | (~member(D, C)))))))),
% 0.13/0.31 inference(transitivity,[status(thm)],[4, 2])).
% 0.13/0.31 tff(6,plain,
% 0.13/0.31 (^[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, 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, 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, B)) | (~member(D, C))))))), 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, 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, 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, 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, B)) | (~member(D, C)))))))))),
% 0.13/0.31 inference(bind,[status(th)],[])).
% 0.13/0.32 tff(7,plain,
% 0.13/0.32 (![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, B)) | (~member(D, C)))))))),
% 0.13/0.32 inference(quant_intro,[status(thm)],[6])).
% 0.13/0.32 tff(8,plain,
% 0.13/0.32 (![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.13/0.32 inference(rewrite,[status(thm)],[])).
% 0.13/0.32 tff(9,axiom,(![B: $i, C: $i] : (intersect(B, C) <=> ?[D: $i] : (member(D, B) & member(D, C)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','intersect_defn')).
% 0.13/0.32 tff(10,plain,
% 0.13/0.32 (![B: $i, C: $i] : (intersect(B, C) <=> ?[D: $i] : (member(D, B) & member(D, C)))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[9, 8])).
% 0.13/0.32 tff(11,plain,(
% 0.13/0.32 ![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.13/0.32 inference(skolemize,[status(sab)],[10])).
% 0.13/0.32 tff(12,plain,
% 0.13/0.32 (![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.13/0.32 inference(modus_ponens,[status(thm)],[11, 7])).
% 0.13/0.32 tff(13,plain,
% 0.13/0.32 (![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.13/0.32 inference(modus_ponens,[status(thm)],[12, 5])).
% 0.13/0.32 tff(14,plain,
% 0.13/0.32 ((~![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)))))))) | (~((~((~intersect(C!2, D!1)) | (~((~member(tptp_fun_D_0(D!1, C!2), C!2)) | (~member(tptp_fun_D_0(D!1, C!2), D!1)))))) | (~(intersect(C!2, D!1) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))))))),
% 0.13/0.32 inference(quant_inst,[status(thm)],[])).
% 0.13/0.32 tff(15,plain,
% 0.13/0.32 (~((~((~intersect(C!2, D!1)) | (~((~member(tptp_fun_D_0(D!1, C!2), C!2)) | (~member(tptp_fun_D_0(D!1, C!2), D!1)))))) | (~(intersect(C!2, D!1) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1))))))),
% 0.13/0.32 inference(unit_resolution,[status(thm)],[14, 13])).
% 0.13/0.32 tff(16,plain,
% 0.13/0.32 (((~((~intersect(C!2, D!1)) | (~((~member(tptp_fun_D_0(D!1, C!2), C!2)) | (~member(tptp_fun_D_0(D!1, C!2), D!1)))))) | (~(intersect(C!2, D!1) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))))) | (intersect(C!2, D!1) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1))))),
% 0.13/0.32 inference(tautology,[status(thm)],[])).
% 0.13/0.32 tff(17,plain,
% 0.13/0.32 (intersect(C!2, D!1) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))),
% 0.13/0.32 inference(unit_resolution,[status(thm)],[16, 15])).
% 0.13/0.32 tff(18,plain,
% 0.13/0.32 ((~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D))) <=> (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D)))),
% 0.13/0.32 inference(rewrite,[status(thm)],[])).
% 0.13/0.32 tff(19,plain,
% 0.13/0.32 ((~![B: $i, C: $i, D: $i] : ((member(B, C) & member(B, D)) => intersect(C, D))) <=> (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D)))),
% 0.13/0.32 inference(rewrite,[status(thm)],[])).
% 0.13/0.32 tff(20,axiom,(~![B: $i, C: $i, D: $i] : ((member(B, C) & member(B, D)) => intersect(C, D))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_th13')).
% 0.13/0.32 tff(21,plain,
% 0.13/0.32 (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[20, 19])).
% 0.13/0.32 tff(22,plain,
% 0.13/0.32 (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[21, 18])).
% 0.13/0.32 tff(23,plain,
% 0.13/0.32 (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[22, 18])).
% 0.13/0.32 tff(24,plain,
% 0.13/0.32 (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[23, 18])).
% 0.13/0.32 tff(25,plain,
% 0.13/0.32 (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[24, 18])).
% 0.13/0.32 tff(26,plain,
% 0.13/0.32 (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[25, 18])).
% 0.13/0.32 tff(27,plain,
% 0.13/0.32 (~![B: $i, C: $i, D: $i] : ((~(member(B, C) & member(B, D))) | intersect(C, D))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[26, 18])).
% 0.13/0.32 tff(28,plain,(
% 0.13/0.32 ~((~(member(B!3, C!2) & member(B!3, D!1))) | intersect(C!2, D!1))),
% 0.13/0.32 inference(skolemize,[status(sab)],[27])).
% 0.13/0.32 tff(29,plain,
% 0.13/0.32 (~intersect(C!2, D!1)),
% 0.13/0.32 inference(or_elim,[status(thm)],[28])).
% 0.13/0.32 tff(30,plain,
% 0.13/0.32 ((~(intersect(C!2, D!1) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1))))) | intersect(C!2, D!1) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))),
% 0.13/0.32 inference(tautology,[status(thm)],[])).
% 0.13/0.32 tff(31,plain,
% 0.13/0.32 ((~(intersect(C!2, D!1) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1))))) | ![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))),
% 0.13/0.32 inference(unit_resolution,[status(thm)],[30, 29])).
% 0.13/0.32 tff(32,plain,
% 0.13/0.32 (![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))),
% 0.13/0.32 inference(unit_resolution,[status(thm)],[31, 17])).
% 0.13/0.32 tff(33,plain,
% 0.13/0.32 (member(B!3, C!2) & member(B!3, D!1)),
% 0.13/0.32 inference(or_elim,[status(thm)],[28])).
% 0.13/0.32 tff(34,plain,
% 0.13/0.32 (member(B!3, D!1)),
% 0.13/0.32 inference(and_elim,[status(thm)],[33])).
% 0.13/0.32 tff(35,plain,
% 0.13/0.32 (member(B!3, C!2)),
% 0.13/0.32 inference(and_elim,[status(thm)],[33])).
% 0.13/0.32 tff(36,plain,
% 0.13/0.32 (((~![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))) | ((~member(B!3, C!2)) | (~member(B!3, D!1)))) <=> ((~![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))) | (~member(B!3, C!2)) | (~member(B!3, D!1)))),
% 0.13/0.32 inference(rewrite,[status(thm)],[])).
% 0.13/0.32 tff(37,plain,
% 0.13/0.32 ((~![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))) | ((~member(B!3, C!2)) | (~member(B!3, D!1)))),
% 0.13/0.32 inference(quant_inst,[status(thm)],[])).
% 0.13/0.32 tff(38,plain,
% 0.13/0.32 ((~![D: $i] : ((~member(D, C!2)) | (~member(D, D!1)))) | (~member(B!3, C!2)) | (~member(B!3, D!1))),
% 0.13/0.32 inference(modus_ponens,[status(thm)],[37, 36])).
% 0.13/0.32 tff(39,plain,
% 0.13/0.32 ($false),
% 0.13/0.32 inference(unit_resolution,[status(thm)],[38, 35, 34, 32])).
% 0.13/0.32 % SZS output end Proof
%------------------------------------------------------------------------------