TSTP Solution File: SET886+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n024.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:08:31 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n024.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 08:30:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 0.13/0.39 % SZS status Theorem
% 0.13/0.39 % SZS output start Proof
% 0.13/0.39 tff(singleton_type, type, (
% 0.13/0.39 singleton: $i > $i)).
% 0.13/0.39 tff(tptp_fun_C_2_type, type, (
% 0.13/0.39 tptp_fun_C_2: $i)).
% 0.13/0.39 tff(unordered_pair_type, type, (
% 0.13/0.39 unordered_pair: ( $i * $i ) > $i)).
% 0.13/0.39 tff(tptp_fun_B_3_type, type, (
% 0.13/0.39 tptp_fun_B_3: $i)).
% 0.13/0.39 tff(tptp_fun_A_4_type, type, (
% 0.13/0.39 tptp_fun_A_4: $i)).
% 0.13/0.39 tff(subset_type, type, (
% 0.13/0.39 subset: ( $i * $i ) > $o)).
% 0.13/0.39 tff(1,plain,
% 0.13/0.39 (^[A: $i] : refl((unordered_pair(A, A) = singleton(A)) <=> (unordered_pair(A, A) = singleton(A)))),
% 0.13/0.39 inference(bind,[status(th)],[])).
% 0.13/0.39 tff(2,plain,
% 0.13/0.39 (![A: $i] : (unordered_pair(A, A) = singleton(A)) <=> ![A: $i] : (unordered_pair(A, A) = singleton(A))),
% 0.13/0.39 inference(quant_intro,[status(thm)],[1])).
% 0.13/0.39 tff(3,plain,
% 0.13/0.39 (![A: $i] : (unordered_pair(A, A) = singleton(A)) <=> ![A: $i] : (unordered_pair(A, A) = singleton(A))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(4,axiom,(![A: $i] : (unordered_pair(A, A) = singleton(A))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t69_enumset1')).
% 0.13/0.39 tff(5,plain,
% 0.13/0.39 (![A: $i] : (unordered_pair(A, A) = singleton(A))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.13/0.39 tff(6,plain,(
% 0.13/0.39 ![A: $i] : (unordered_pair(A, A) = singleton(A))),
% 0.13/0.39 inference(skolemize,[status(sab)],[5])).
% 0.13/0.39 tff(7,plain,
% 0.13/0.39 (![A: $i] : (unordered_pair(A, A) = singleton(A))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.13/0.39 tff(8,plain,
% 0.13/0.39 ((~![A: $i] : (unordered_pair(A, A) = singleton(A))) | (unordered_pair(C!2, C!2) = singleton(C!2))),
% 0.13/0.39 inference(quant_inst,[status(thm)],[])).
% 0.13/0.39 tff(9,plain,
% 0.13/0.39 (unordered_pair(C!2, C!2) = singleton(C!2)),
% 0.13/0.39 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.13/0.39 tff(10,plain,
% 0.13/0.39 (^[A: $i, B: $i] : refl((unordered_pair(A, B) = unordered_pair(B, A)) <=> (unordered_pair(A, B) = unordered_pair(B, A)))),
% 0.13/0.39 inference(bind,[status(th)],[])).
% 0.13/0.39 tff(11,plain,
% 0.13/0.39 (![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A)) <=> ![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A))),
% 0.13/0.39 inference(quant_intro,[status(thm)],[10])).
% 0.13/0.39 tff(12,plain,
% 0.13/0.39 (![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A)) <=> ![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(13,axiom,(![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','commutativity_k2_tarski')).
% 0.13/0.39 tff(14,plain,
% 0.13/0.39 (![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.13/0.39 tff(15,plain,(
% 0.13/0.39 ![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A))),
% 0.13/0.39 inference(skolemize,[status(sab)],[14])).
% 0.13/0.39 tff(16,plain,
% 0.13/0.39 (![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[15, 11])).
% 0.13/0.39 tff(17,plain,
% 0.13/0.39 ((~![A: $i, B: $i] : (unordered_pair(A, B) = unordered_pair(B, A))) | (unordered_pair(A!4, B!3) = unordered_pair(B!3, A!4))),
% 0.13/0.39 inference(quant_inst,[status(thm)],[])).
% 0.13/0.39 tff(18,plain,
% 0.13/0.39 (unordered_pair(A!4, B!3) = unordered_pair(B!3, A!4)),
% 0.13/0.39 inference(unit_resolution,[status(thm)],[17, 16])).
% 0.13/0.39 tff(19,plain,
% 0.13/0.39 (unordered_pair(B!3, A!4) = unordered_pair(A!4, B!3)),
% 0.13/0.39 inference(symmetry,[status(thm)],[18])).
% 0.13/0.39 tff(20,plain,
% 0.13/0.39 ((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C)))) <=> (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(21,plain,
% 0.13/0.39 ((~![A: $i, B: $i, C: $i] : (subset(unordered_pair(A, B), singleton(C)) => (unordered_pair(A, B) = singleton(C)))) <=> (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(22,axiom,(~![A: $i, B: $i, C: $i] : (subset(unordered_pair(A, B), singleton(C)) => (unordered_pair(A, B) = singleton(C)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t27_zfmisc_1')).
% 0.13/0.39 tff(23,plain,
% 0.13/0.39 (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[22, 21])).
% 0.19/0.39 tff(24,plain,
% 0.19/0.39 (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[23, 20])).
% 0.19/0.39 tff(25,plain,
% 0.19/0.39 (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[24, 20])).
% 0.19/0.39 tff(26,plain,
% 0.19/0.39 (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[25, 20])).
% 0.19/0.39 tff(27,plain,
% 0.19/0.39 (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[26, 20])).
% 0.19/0.39 tff(28,plain,
% 0.19/0.39 (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[27, 20])).
% 0.19/0.39 tff(29,plain,
% 0.19/0.39 (~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (unordered_pair(A, B) = singleton(C)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[28, 20])).
% 0.19/0.39 tff(30,plain,(
% 0.19/0.39 ~((~subset(unordered_pair(A!4, B!3), singleton(C!2))) | (unordered_pair(A!4, B!3) = singleton(C!2)))),
% 0.19/0.39 inference(skolemize,[status(sab)],[29])).
% 0.19/0.39 tff(31,plain,
% 0.19/0.39 (subset(unordered_pair(A!4, B!3), singleton(C!2))),
% 0.19/0.39 inference(or_elim,[status(thm)],[30])).
% 0.19/0.39 tff(32,plain,
% 0.19/0.39 (^[A: $i, B: $i, C: $i] : refl(((~subset(unordered_pair(A, B), singleton(C))) | (A = C)) <=> ((~subset(unordered_pair(A, B), singleton(C))) | (A = C)))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(33,plain,
% 0.19/0.39 (![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C)) <=> ![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[32])).
% 0.19/0.39 tff(34,plain,
% 0.19/0.39 (![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C)) <=> ![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(35,plain,
% 0.19/0.39 (^[A: $i, B: $i, C: $i] : rewrite((subset(unordered_pair(A, B), singleton(C)) => (A = C)) <=> ((~subset(unordered_pair(A, B), singleton(C))) | (A = C)))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(36,plain,
% 0.19/0.39 (![A: $i, B: $i, C: $i] : (subset(unordered_pair(A, B), singleton(C)) => (A = C)) <=> ![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[35])).
% 0.19/0.39 tff(37,axiom,(![A: $i, B: $i, C: $i] : (subset(unordered_pair(A, B), singleton(C)) => (A = C))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t26_zfmisc_1')).
% 0.19/0.39 tff(38,plain,
% 0.19/0.39 (![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[37, 36])).
% 0.19/0.39 tff(39,plain,
% 0.19/0.39 (![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[38, 34])).
% 0.19/0.39 tff(40,plain,(
% 0.19/0.39 ![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))),
% 0.19/0.39 inference(skolemize,[status(sab)],[39])).
% 0.19/0.39 tff(41,plain,
% 0.19/0.39 (![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[40, 33])).
% 0.19/0.39 tff(42,plain,
% 0.19/0.39 (((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))) | ((~subset(unordered_pair(A!4, B!3), singleton(C!2))) | (A!4 = C!2))) <=> ((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))) | (~subset(unordered_pair(A!4, B!3), singleton(C!2))) | (A!4 = C!2))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(43,plain,
% 0.19/0.39 ((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))) | ((~subset(unordered_pair(A!4, B!3), singleton(C!2))) | (A!4 = C!2))),
% 0.19/0.39 inference(quant_inst,[status(thm)],[])).
% 0.19/0.39 tff(44,plain,
% 0.19/0.39 ((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))) | (~subset(unordered_pair(A!4, B!3), singleton(C!2))) | (A!4 = C!2)),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[43, 42])).
% 0.19/0.40 tff(45,plain,
% 0.19/0.40 (A!4 = C!2),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[44, 41, 31])).
% 0.19/0.40 tff(46,plain,
% 0.19/0.40 (C!2 = A!4),
% 0.19/0.40 inference(symmetry,[status(thm)],[45])).
% 0.19/0.40 tff(47,plain,
% 0.19/0.40 (unordered_pair(B!3, C!2) = unordered_pair(B!3, A!4)),
% 0.19/0.40 inference(monotonicity,[status(thm)],[46])).
% 0.19/0.40 tff(48,plain,
% 0.19/0.40 (unordered_pair(B!3, C!2) = unordered_pair(A!4, B!3)),
% 0.19/0.40 inference(transitivity,[status(thm)],[47, 19])).
% 0.19/0.40 tff(49,plain,
% 0.19/0.40 (subset(unordered_pair(B!3, C!2), singleton(C!2)) <=> subset(unordered_pair(A!4, B!3), singleton(C!2))),
% 0.19/0.40 inference(monotonicity,[status(thm)],[48])).
% 0.19/0.40 tff(50,plain,
% 0.19/0.40 (subset(unordered_pair(A!4, B!3), singleton(C!2)) <=> subset(unordered_pair(B!3, C!2), singleton(C!2))),
% 0.19/0.40 inference(symmetry,[status(thm)],[49])).
% 0.19/0.40 tff(51,plain,
% 0.19/0.40 (subset(unordered_pair(B!3, C!2), singleton(C!2))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[31, 50])).
% 0.19/0.40 tff(52,plain,
% 0.19/0.40 (((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))) | ((~subset(unordered_pair(B!3, C!2), singleton(C!2))) | (B!3 = C!2))) <=> ((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))) | (~subset(unordered_pair(B!3, C!2), singleton(C!2))) | (B!3 = C!2))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(53,plain,
% 0.19/0.40 ((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))) | ((~subset(unordered_pair(B!3, C!2), singleton(C!2))) | (B!3 = C!2))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(54,plain,
% 0.19/0.40 ((~![A: $i, B: $i, C: $i] : ((~subset(unordered_pair(A, B), singleton(C))) | (A = C))) | (~subset(unordered_pair(B!3, C!2), singleton(C!2))) | (B!3 = C!2)),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[53, 52])).
% 0.19/0.40 tff(55,plain,
% 0.19/0.40 ((~subset(unordered_pair(B!3, C!2), singleton(C!2))) | (B!3 = C!2)),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[54, 41])).
% 0.19/0.40 tff(56,plain,
% 0.19/0.40 (B!3 = C!2),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[55, 51])).
% 0.19/0.40 tff(57,plain,
% 0.19/0.40 (C!2 = B!3),
% 0.19/0.40 inference(symmetry,[status(thm)],[56])).
% 0.19/0.40 tff(58,plain,
% 0.19/0.40 (unordered_pair(C!2, C!2) = unordered_pair(A!4, B!3)),
% 0.19/0.40 inference(monotonicity,[status(thm)],[46, 57])).
% 0.19/0.40 tff(59,plain,
% 0.19/0.40 (unordered_pair(A!4, B!3) = unordered_pair(C!2, C!2)),
% 0.19/0.40 inference(symmetry,[status(thm)],[58])).
% 0.19/0.40 tff(60,plain,
% 0.19/0.40 (unordered_pair(A!4, B!3) = singleton(C!2)),
% 0.19/0.40 inference(transitivity,[status(thm)],[59, 9])).
% 0.19/0.40 tff(61,plain,
% 0.19/0.40 (~(unordered_pair(A!4, B!3) = singleton(C!2))),
% 0.19/0.40 inference(or_elim,[status(thm)],[30])).
% 0.19/0.40 tff(62,plain,
% 0.19/0.40 ($false),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[61, 60])).
% 0.19/0.40 % SZS output end Proof
%------------------------------------------------------------------------------