TSTP Solution File: SEU122+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SEU122+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n025.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:34 EDT 2022
% Result : Theorem 0.21s 0.40s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU122+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Sep 3 09:41:18 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.36 Usage: tptp [options] [-file:]file
% 0.14/0.36 -h, -? prints this message.
% 0.14/0.36 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.36 -m, -model generate model.
% 0.14/0.36 -p, -proof generate proof.
% 0.14/0.36 -c, -core generate unsat core of named formulas.
% 0.14/0.36 -st, -statistics display statistics.
% 0.14/0.36 -t:timeout set timeout (in second).
% 0.14/0.36 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.36 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.36 -<param>:<value> configuration parameter and value.
% 0.14/0.36 -o:<output-file> file to place output in.
% 0.21/0.40 % SZS status Theorem
% 0.21/0.40 % SZS output start Proof
% 0.21/0.40 tff(in_type, type, (
% 0.21/0.40 in: ( $i * $i ) > $o)).
% 0.21/0.40 tff(empty_set_type, type, (
% 0.21/0.40 empty_set: $i)).
% 0.21/0.40 tff(tptp_fun_C_0_type, type, (
% 0.21/0.40 tptp_fun_C_0: ( $i * $i ) > $i)).
% 0.21/0.40 tff(tptp_fun_A_3_type, type, (
% 0.21/0.40 tptp_fun_A_3: $i)).
% 0.21/0.40 tff(subset_type, type, (
% 0.21/0.40 subset: ( $i * $i ) > $o)).
% 0.21/0.40 tff(empty_type, type, (
% 0.21/0.40 empty: $i > $o)).
% 0.21/0.40 tff(1,plain,
% 0.21/0.40 (^[A: $i, B: $i] : refl((~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))))) <=> (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))))))),
% 0.21/0.40 inference(bind,[status(th)],[])).
% 0.21/0.40 tff(2,plain,
% 0.21/0.40 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))),
% 0.21/0.40 inference(quant_intro,[status(thm)],[1])).
% 0.21/0.40 tff(3,plain,
% 0.21/0.40 (^[A: $i, B: $i] : rewrite((~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))))) <=> (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))))))),
% 0.21/0.40 inference(bind,[status(th)],[])).
% 0.21/0.40 tff(4,plain,
% 0.21/0.40 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))),
% 0.21/0.40 inference(quant_intro,[status(thm)],[3])).
% 0.21/0.40 tff(5,plain,
% 0.21/0.40 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))),
% 0.21/0.40 inference(transitivity,[status(thm)],[4, 2])).
% 0.21/0.40 tff(6,plain,
% 0.21/0.40 (^[A: $i, B: $i] : trans(monotonicity(rewrite(((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) <=> ((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))), rewrite((subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))) <=> (subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))), ((((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))) <=> (((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))))), rewrite((((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))) <=> (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))), ((((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))) <=> (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))))),
% 0.21/0.40 inference(bind,[status(th)],[])).
% 0.21/0.40 tff(7,plain,
% 0.21/0.40 (![A: $i, B: $i] : (((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))),
% 0.21/0.40 inference(quant_intro,[status(thm)],[6])).
% 0.21/0.40 tff(8,plain,
% 0.21/0.40 (![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B))) <=> ![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B)))),
% 0.21/0.40 inference(rewrite,[status(thm)],[])).
% 0.21/0.40 tff(9,plain,
% 0.21/0.40 (^[A: $i, B: $i] : rewrite((subset(A, B) <=> ![C: $i] : (in(C, A) => in(C, B))) <=> (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B))))),
% 0.21/0.40 inference(bind,[status(th)],[])).
% 0.21/0.40 tff(10,plain,
% 0.21/0.40 (![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : (in(C, A) => in(C, B))) <=> ![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B)))),
% 0.21/0.40 inference(quant_intro,[status(thm)],[9])).
% 0.21/0.40 tff(11,axiom,(![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : (in(C, A) => in(C, B)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','d3_tarski')).
% 0.21/0.40 tff(12,plain,
% 0.21/0.40 (![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B)))),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[11, 10])).
% 0.21/0.40 tff(13,plain,
% 0.21/0.40 (![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B)))),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[12, 8])).
% 0.21/0.40 tff(14,plain,(
% 0.21/0.40 ![A: $i, B: $i] : (((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))),
% 0.21/0.40 inference(skolemize,[status(sab)],[13])).
% 0.21/0.40 tff(15,plain,
% 0.21/0.40 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[14, 7])).
% 0.21/0.40 tff(16,plain,
% 0.21/0.40 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[15, 5])).
% 0.21/0.40 tff(17,plain,
% 0.21/0.40 ((~![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_0(B, A), A)) | in(tptp_fun_C_0(B, A), B)))))))) | (~((~((~subset(empty_set, A!3)) | ![C: $i] : ((~in(C, empty_set)) | in(C, A!3)))) | (~(subset(empty_set, A!3) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3)))))))),
% 0.21/0.40 inference(quant_inst,[status(thm)],[])).
% 0.21/0.40 tff(18,plain,
% 0.21/0.40 (~((~((~subset(empty_set, A!3)) | ![C: $i] : ((~in(C, empty_set)) | in(C, A!3)))) | (~(subset(empty_set, A!3) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3))))))),
% 0.21/0.40 inference(unit_resolution,[status(thm)],[17, 16])).
% 0.21/0.40 tff(19,plain,
% 0.21/0.40 (((~((~subset(empty_set, A!3)) | ![C: $i] : ((~in(C, empty_set)) | in(C, A!3)))) | (~(subset(empty_set, A!3) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3)))))) | (subset(empty_set, A!3) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3))))),
% 0.21/0.40 inference(tautology,[status(thm)],[])).
% 0.21/0.40 tff(20,plain,
% 0.21/0.40 (subset(empty_set, A!3) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3)))),
% 0.21/0.40 inference(unit_resolution,[status(thm)],[19, 18])).
% 0.21/0.40 tff(21,plain,
% 0.21/0.40 ((~![A: $i] : subset(empty_set, A)) <=> (~![A: $i] : subset(empty_set, A))),
% 0.21/0.40 inference(rewrite,[status(thm)],[])).
% 0.21/0.40 tff(22,axiom,(~![A: $i] : subset(empty_set, A)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t2_xboole_1')).
% 0.21/0.40 tff(23,plain,
% 0.21/0.40 (~![A: $i] : subset(empty_set, A)),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[22, 21])).
% 0.21/0.40 tff(24,plain,
% 0.21/0.40 (~![A: $i] : subset(empty_set, A)),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[23, 21])).
% 0.21/0.40 tff(25,plain,
% 0.21/0.40 (~![A: $i] : subset(empty_set, A)),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[24, 21])).
% 0.21/0.40 tff(26,plain,
% 0.21/0.40 (~![A: $i] : subset(empty_set, A)),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[25, 21])).
% 0.21/0.40 tff(27,plain,
% 0.21/0.40 (~![A: $i] : subset(empty_set, A)),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[26, 21])).
% 0.21/0.40 tff(28,plain,
% 0.21/0.40 (~![A: $i] : subset(empty_set, A)),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[27, 21])).
% 0.21/0.40 tff(29,plain,
% 0.21/0.40 (~![A: $i] : subset(empty_set, A)),
% 0.21/0.40 inference(modus_ponens,[status(thm)],[28, 21])).
% 0.21/0.40 tff(30,plain,(
% 0.21/0.40 ~subset(empty_set, A!3)),
% 0.21/0.40 inference(skolemize,[status(sab)],[29])).
% 0.21/0.41 tff(31,plain,
% 0.21/0.41 ((~(subset(empty_set, A!3) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3))))) | subset(empty_set, A!3) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3)))),
% 0.21/0.41 inference(tautology,[status(thm)],[])).
% 0.21/0.41 tff(32,plain,
% 0.21/0.41 ((~(subset(empty_set, A!3) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3))))) | (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3)))),
% 0.21/0.41 inference(unit_resolution,[status(thm)],[31, 30])).
% 0.21/0.41 tff(33,plain,
% 0.21/0.41 (~((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3))),
% 0.21/0.41 inference(unit_resolution,[status(thm)],[32, 20])).
% 0.21/0.41 tff(34,plain,
% 0.21/0.41 (((~in(tptp_fun_C_0(A!3, empty_set), empty_set)) | in(tptp_fun_C_0(A!3, empty_set), A!3)) | in(tptp_fun_C_0(A!3, empty_set), empty_set)),
% 0.21/0.41 inference(tautology,[status(thm)],[])).
% 0.21/0.41 tff(35,plain,
% 0.21/0.41 (in(tptp_fun_C_0(A!3, empty_set), empty_set)),
% 0.21/0.41 inference(unit_resolution,[status(thm)],[34, 33])).
% 0.21/0.41 tff(36,plain,
% 0.21/0.41 (^[A: $i, B: $i] : refl(((~empty(B)) | (~in(A, B))) <=> ((~empty(B)) | (~in(A, B))))),
% 0.21/0.41 inference(bind,[status(th)],[])).
% 0.21/0.41 tff(37,plain,
% 0.21/0.41 (![A: $i, B: $i] : ((~empty(B)) | (~in(A, B))) <=> ![A: $i, B: $i] : ((~empty(B)) | (~in(A, B)))),
% 0.21/0.41 inference(quant_intro,[status(thm)],[36])).
% 0.21/0.41 tff(38,plain,
% 0.21/0.41 (^[A: $i, B: $i] : trans(monotonicity(rewrite((in(A, B) & empty(B)) <=> (~((~empty(B)) | (~in(A, B))))), ((~(in(A, B) & empty(B))) <=> (~(~((~empty(B)) | (~in(A, B))))))), rewrite((~(~((~empty(B)) | (~in(A, B))))) <=> ((~empty(B)) | (~in(A, B)))), ((~(in(A, B) & empty(B))) <=> ((~empty(B)) | (~in(A, B)))))),
% 0.21/0.41 inference(bind,[status(th)],[])).
% 0.21/0.41 tff(39,plain,
% 0.21/0.41 (![A: $i, B: $i] : (~(in(A, B) & empty(B))) <=> ![A: $i, B: $i] : ((~empty(B)) | (~in(A, B)))),
% 0.21/0.41 inference(quant_intro,[status(thm)],[38])).
% 0.21/0.41 tff(40,plain,
% 0.21/0.41 (![A: $i, B: $i] : (~(in(A, B) & empty(B))) <=> ![A: $i, B: $i] : (~(in(A, B) & empty(B)))),
% 0.21/0.41 inference(rewrite,[status(thm)],[])).
% 0.21/0.41 tff(41,axiom,(![A: $i, B: $i] : (~(in(A, B) & empty(B)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t7_boole')).
% 0.21/0.41 tff(42,plain,
% 0.21/0.41 (![A: $i, B: $i] : (~(in(A, B) & empty(B)))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[41, 40])).
% 0.21/0.41 tff(43,plain,(
% 0.21/0.41 ![A: $i, B: $i] : (~(in(A, B) & empty(B)))),
% 0.21/0.41 inference(skolemize,[status(sab)],[42])).
% 0.21/0.41 tff(44,plain,
% 0.21/0.41 (![A: $i, B: $i] : ((~empty(B)) | (~in(A, B)))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[43, 39])).
% 0.21/0.41 tff(45,plain,
% 0.21/0.41 (![A: $i, B: $i] : ((~empty(B)) | (~in(A, B)))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[44, 37])).
% 0.21/0.41 tff(46,plain,
% 0.21/0.41 (empty(empty_set) <=> empty(empty_set)),
% 0.21/0.41 inference(rewrite,[status(thm)],[])).
% 0.21/0.41 tff(47,axiom,(empty(empty_set)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','fc1_xboole_0')).
% 0.21/0.41 tff(48,plain,
% 0.21/0.41 (empty(empty_set)),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[47, 46])).
% 0.21/0.41 tff(49,plain,
% 0.21/0.41 (((~![A: $i, B: $i] : ((~empty(B)) | (~in(A, B)))) | ((~empty(empty_set)) | (~in(tptp_fun_C_0(A!3, empty_set), empty_set)))) <=> ((~![A: $i, B: $i] : ((~empty(B)) | (~in(A, B)))) | (~empty(empty_set)) | (~in(tptp_fun_C_0(A!3, empty_set), empty_set)))),
% 0.21/0.41 inference(rewrite,[status(thm)],[])).
% 0.21/0.41 tff(50,plain,
% 0.21/0.41 ((~![A: $i, B: $i] : ((~empty(B)) | (~in(A, B)))) | ((~empty(empty_set)) | (~in(tptp_fun_C_0(A!3, empty_set), empty_set)))),
% 0.21/0.41 inference(quant_inst,[status(thm)],[])).
% 0.21/0.41 tff(51,plain,
% 0.21/0.41 ((~![A: $i, B: $i] : ((~empty(B)) | (~in(A, B)))) | (~empty(empty_set)) | (~in(tptp_fun_C_0(A!3, empty_set), empty_set))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[50, 49])).
% 0.21/0.41 tff(52,plain,
% 0.21/0.41 ($false),
% 0.21/0.41 inference(unit_resolution,[status(thm)],[51, 48, 45, 35])).
% 0.21/0.41 % SZS output end Proof
%------------------------------------------------------------------------------