TSTP Solution File: SET813+4 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET813+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n007.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:07 EDT 2022
% Result : Theorem 0.19s 0.40s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET813+4 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Sep 3 07:48:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.19/0.40 % SZS status Theorem
% 0.19/0.40 % SZS output start Proof
% 0.19/0.40 tff(member_type, type, (
% 0.19/0.40 member: ( $i * $i ) > $o)).
% 0.19/0.40 tff(singleton_type, type, (
% 0.19/0.40 singleton: $i > $i)).
% 0.19/0.40 tff(tptp_fun_A_13_type, type, (
% 0.19/0.40 tptp_fun_A_13: $i)).
% 0.19/0.40 tff(union_type, type, (
% 0.19/0.40 union: ( $i * $i ) > $i)).
% 0.19/0.40 tff(suc_type, type, (
% 0.19/0.40 suc: $i > $i)).
% 0.19/0.40 tff(on_type, type, (
% 0.19/0.40 on: $i)).
% 0.19/0.40 tff(1,plain,
% 0.19/0.40 (^[X: $i, A: $i, B: $i] : refl((member(X, union(A, B)) <=> (member(X, B) | member(X, A))) <=> (member(X, union(A, B)) <=> (member(X, B) | member(X, A))))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(2,plain,
% 0.19/0.40 (![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A))) <=> ![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A)))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[1])).
% 0.19/0.40 tff(3,plain,
% 0.19/0.40 (![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A))) <=> ![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A)))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(4,plain,
% 0.19/0.40 (^[X: $i, A: $i, B: $i] : rewrite((member(X, union(A, B)) <=> (member(X, A) | member(X, B))) <=> (member(X, union(A, B)) <=> (member(X, B) | member(X, A))))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(5,plain,
% 0.19/0.40 (![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, A) | member(X, B))) <=> ![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A)))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[4])).
% 0.19/0.40 tff(6,axiom,(![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, A) | member(X, B)))), file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax','union')).
% 0.19/0.40 tff(7,plain,
% 0.19/0.40 (![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.19/0.40 tff(8,plain,
% 0.19/0.40 (![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.19/0.40 tff(9,plain,(
% 0.19/0.40 ![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A)))),
% 0.19/0.40 inference(skolemize,[status(sab)],[8])).
% 0.19/0.40 tff(10,plain,
% 0.19/0.40 (![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[9, 2])).
% 0.19/0.40 tff(11,plain,
% 0.19/0.40 ((~![X: $i, A: $i, B: $i] : (member(X, union(A, B)) <=> (member(X, B) | member(X, A)))) | (member(A!13, union(A!13, singleton(A!13))) <=> (member(A!13, singleton(A!13)) | member(A!13, A!13)))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(12,plain,
% 0.19/0.40 (member(A!13, union(A!13, singleton(A!13))) <=> (member(A!13, singleton(A!13)) | member(A!13, A!13))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[11, 10])).
% 0.19/0.40 tff(13,plain,
% 0.19/0.40 (^[A: $i, X: $i] : refl((member(X, suc(A)) <=> member(X, union(A, singleton(A)))) <=> (member(X, suc(A)) <=> member(X, union(A, singleton(A)))))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(14,plain,
% 0.19/0.40 (![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A)))) <=> ![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A))))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[13])).
% 0.19/0.40 tff(15,plain,
% 0.19/0.40 (![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A)))) <=> ![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(16,axiom,(![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A))))), file('/export/starexec/sandbox2/benchmark/Axioms/SET006+4.ax','successor')).
% 0.19/0.40 tff(17,plain,
% 0.19/0.40 (![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[16, 15])).
% 0.19/0.40 tff(18,plain,(
% 0.19/0.40 ![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A))))),
% 0.19/0.40 inference(skolemize,[status(sab)],[17])).
% 0.19/0.40 tff(19,plain,
% 0.19/0.40 (![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[18, 14])).
% 0.19/0.40 tff(20,plain,
% 0.19/0.40 ((~![A: $i, X: $i] : (member(X, suc(A)) <=> member(X, union(A, singleton(A))))) | (member(A!13, suc(A!13)) <=> member(A!13, union(A!13, singleton(A!13))))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(21,plain,
% 0.19/0.40 (member(A!13, suc(A!13)) <=> member(A!13, union(A!13, singleton(A!13)))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[20, 19])).
% 0.19/0.40 tff(22,plain,
% 0.19/0.40 ((~![A: $i] : ((~member(A, on)) | member(A, suc(A)))) <=> (~![A: $i] : ((~member(A, on)) | member(A, suc(A))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(23,plain,
% 0.19/0.40 ((~![A: $i] : (member(A, on) => member(A, suc(A)))) <=> (~![A: $i] : ((~member(A, on)) | member(A, suc(A))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(24,axiom,(~![A: $i] : (member(A, on) => member(A, suc(A)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thV12')).
% 0.19/0.40 tff(25,plain,
% 0.19/0.40 (~![A: $i] : ((~member(A, on)) | member(A, suc(A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[24, 23])).
% 0.19/0.40 tff(26,plain,
% 0.19/0.40 (~![A: $i] : ((~member(A, on)) | member(A, suc(A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[25, 22])).
% 0.19/0.40 tff(27,plain,
% 0.19/0.40 (~![A: $i] : ((~member(A, on)) | member(A, suc(A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[26, 22])).
% 0.19/0.40 tff(28,plain,
% 0.19/0.40 (~![A: $i] : ((~member(A, on)) | member(A, suc(A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[27, 22])).
% 0.19/0.40 tff(29,plain,
% 0.19/0.40 (~![A: $i] : ((~member(A, on)) | member(A, suc(A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[28, 22])).
% 0.19/0.40 tff(30,plain,
% 0.19/0.40 (~![A: $i] : ((~member(A, on)) | member(A, suc(A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[29, 22])).
% 0.19/0.40 tff(31,plain,
% 0.19/0.40 (~![A: $i] : ((~member(A, on)) | member(A, suc(A)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[30, 22])).
% 0.19/0.40 tff(32,plain,(
% 0.19/0.40 ~((~member(A!13, on)) | member(A!13, suc(A!13)))),
% 0.19/0.40 inference(skolemize,[status(sab)],[31])).
% 0.19/0.40 tff(33,plain,
% 0.19/0.40 (~member(A!13, suc(A!13))),
% 0.19/0.40 inference(or_elim,[status(thm)],[32])).
% 0.19/0.40 tff(34,plain,
% 0.19/0.40 ((~(member(A!13, suc(A!13)) <=> member(A!13, union(A!13, singleton(A!13))))) | member(A!13, suc(A!13)) | (~member(A!13, union(A!13, singleton(A!13))))),
% 0.19/0.40 inference(tautology,[status(thm)],[])).
% 0.19/0.40 tff(35,plain,
% 0.19/0.40 ((~(member(A!13, suc(A!13)) <=> member(A!13, union(A!13, singleton(A!13))))) | (~member(A!13, union(A!13, singleton(A!13))))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[34, 33])).
% 0.19/0.40 tff(36,plain,
% 0.19/0.40 (~member(A!13, union(A!13, singleton(A!13)))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[35, 21])).
% 0.19/0.40 tff(37,plain,
% 0.19/0.40 ((~(member(A!13, union(A!13, singleton(A!13))) <=> (member(A!13, singleton(A!13)) | member(A!13, A!13)))) | member(A!13, union(A!13, singleton(A!13))) | (~(member(A!13, singleton(A!13)) | member(A!13, A!13)))),
% 0.19/0.40 inference(tautology,[status(thm)],[])).
% 0.19/0.40 tff(38,plain,
% 0.19/0.40 ((~(member(A!13, union(A!13, singleton(A!13))) <=> (member(A!13, singleton(A!13)) | member(A!13, A!13)))) | (~(member(A!13, singleton(A!13)) | member(A!13, A!13)))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[37, 36])).
% 0.19/0.40 tff(39,plain,
% 0.19/0.40 (~(member(A!13, singleton(A!13)) | member(A!13, A!13))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[38, 12])).
% 0.19/0.40 tff(40,plain,
% 0.19/0.40 ((member(A!13, singleton(A!13)) | member(A!13, A!13)) | (~member(A!13, singleton(A!13)))),
% 0.19/0.40 inference(tautology,[status(thm)],[])).
% 0.19/0.40 tff(41,plain,
% 0.19/0.40 (~member(A!13, singleton(A!13))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[40, 39])).
% 0.19/0.40 tff(42,plain,
% 0.19/0.40 (^[X: $i, A: $i] : refl((member(X, singleton(A)) <=> (X = A)) <=> (member(X, singleton(A)) <=> (X = A)))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(43,plain,
% 0.19/0.40 (![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A)) <=> ![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[42])).
% 0.19/0.40 tff(44,plain,
% 0.19/0.40 (![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A)) <=> ![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(45,axiom,(![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))), file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax','singleton')).
% 0.19/0.40 tff(46,plain,
% 0.19/0.40 (![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[45, 44])).
% 0.19/0.40 tff(47,plain,(
% 0.19/0.40 ![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))),
% 0.19/0.40 inference(skolemize,[status(sab)],[46])).
% 0.19/0.40 tff(48,plain,
% 0.19/0.40 (![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[47, 43])).
% 0.19/0.40 tff(49,plain,
% 0.19/0.40 (((~![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))) | member(A!13, singleton(A!13))) <=> ((~![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))) | member(A!13, singleton(A!13)))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(50,plain,
% 0.19/0.40 ((member(A!13, singleton(A!13)) <=> $true) <=> member(A!13, singleton(A!13))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(51,plain,
% 0.19/0.40 ((A!13 = A!13) <=> $true),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(52,plain,
% 0.19/0.40 ((member(A!13, singleton(A!13)) <=> (A!13 = A!13)) <=> (member(A!13, singleton(A!13)) <=> $true)),
% 0.19/0.40 inference(monotonicity,[status(thm)],[51])).
% 0.19/0.40 tff(53,plain,
% 0.19/0.40 ((member(A!13, singleton(A!13)) <=> (A!13 = A!13)) <=> member(A!13, singleton(A!13))),
% 0.19/0.40 inference(transitivity,[status(thm)],[52, 50])).
% 0.19/0.40 tff(54,plain,
% 0.19/0.40 (((~![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))) | (member(A!13, singleton(A!13)) <=> (A!13 = A!13))) <=> ((~![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))) | member(A!13, singleton(A!13)))),
% 0.19/0.40 inference(monotonicity,[status(thm)],[53])).
% 0.19/0.40 tff(55,plain,
% 0.19/0.40 (((~![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))) | (member(A!13, singleton(A!13)) <=> (A!13 = A!13))) <=> ((~![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))) | member(A!13, singleton(A!13)))),
% 0.19/0.40 inference(transitivity,[status(thm)],[54, 49])).
% 0.19/0.40 tff(56,plain,
% 0.19/0.40 ((~![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))) | (member(A!13, singleton(A!13)) <=> (A!13 = A!13))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(57,plain,
% 0.19/0.40 ((~![X: $i, A: $i] : (member(X, singleton(A)) <=> (X = A))) | member(A!13, singleton(A!13))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[56, 55])).
% 0.19/0.40 tff(58,plain,
% 0.19/0.40 ($false),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[57, 48, 41])).
% 0.19/0.40 % SZS output end Proof
%------------------------------------------------------------------------------