TSTP Solution File: SEU230+2 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SEU230+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n011.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:28:20 EDT 2022
% Result : Theorem 1.32s 1.08s
% Output : Proof 1.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU230+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Sep 3 10:43:13 EDT 2022
% 0.13/0.35 % 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.
% 1.32/1.08 % SZS status Theorem
% 1.32/1.08 % SZS output start Proof
% 1.32/1.08 tff(subset_type, type, (
% 1.32/1.08 subset: ( $i * $i ) > $o)).
% 1.32/1.08 tff(set_union2_type, type, (
% 1.32/1.08 set_union2: ( $i * $i ) > $i)).
% 1.32/1.08 tff(tptp_fun_A_73_type, type, (
% 1.32/1.08 tptp_fun_A_73: $i)).
% 1.32/1.08 tff(singleton_type, type, (
% 1.32/1.08 singleton: $i > $i)).
% 1.32/1.08 tff(succ_type, type, (
% 1.32/1.08 succ: $i > $i)).
% 1.32/1.08 tff(in_type, type, (
% 1.32/1.08 in: ( $i * $i ) > $o)).
% 1.32/1.08 tff(1,plain,
% 1.32/1.08 (^[A: $i] : refl((succ(A) = set_union2(A, singleton(A))) <=> (succ(A) = set_union2(A, singleton(A))))),
% 1.32/1.08 inference(bind,[status(th)],[])).
% 1.32/1.08 tff(2,plain,
% 1.32/1.08 (![A: $i] : (succ(A) = set_union2(A, singleton(A))) <=> ![A: $i] : (succ(A) = set_union2(A, singleton(A)))),
% 1.32/1.08 inference(quant_intro,[status(thm)],[1])).
% 1.32/1.08 tff(3,plain,
% 1.32/1.08 (![A: $i] : (succ(A) = set_union2(A, singleton(A))) <=> ![A: $i] : (succ(A) = set_union2(A, singleton(A)))),
% 1.32/1.08 inference(rewrite,[status(thm)],[])).
% 1.32/1.08 tff(4,axiom,(![A: $i] : (succ(A) = set_union2(A, singleton(A)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','d1_ordinal1')).
% 1.32/1.08 tff(5,plain,
% 1.32/1.08 (![A: $i] : (succ(A) = set_union2(A, singleton(A)))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[4, 3])).
% 1.32/1.08 tff(6,plain,(
% 1.32/1.08 ![A: $i] : (succ(A) = set_union2(A, singleton(A)))),
% 1.32/1.08 inference(skolemize,[status(sab)],[5])).
% 1.32/1.08 tff(7,plain,
% 1.32/1.08 (![A: $i] : (succ(A) = set_union2(A, singleton(A)))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[6, 2])).
% 1.32/1.08 tff(8,plain,
% 1.32/1.08 ((~![A: $i] : (succ(A) = set_union2(A, singleton(A)))) | (succ(A!73) = set_union2(A!73, singleton(A!73)))),
% 1.32/1.08 inference(quant_inst,[status(thm)],[])).
% 1.32/1.08 tff(9,plain,
% 1.32/1.08 (succ(A!73) = set_union2(A!73, singleton(A!73))),
% 1.32/1.08 inference(unit_resolution,[status(thm)],[8, 7])).
% 1.32/1.08 tff(10,plain,
% 1.32/1.08 (set_union2(A!73, singleton(A!73)) = succ(A!73)),
% 1.32/1.08 inference(symmetry,[status(thm)],[9])).
% 1.32/1.08 tff(11,plain,
% 1.32/1.08 (^[A: $i, B: $i] : refl((set_union2(A, B) = set_union2(B, A)) <=> (set_union2(A, B) = set_union2(B, A)))),
% 1.32/1.08 inference(bind,[status(th)],[])).
% 1.32/1.08 tff(12,plain,
% 1.32/1.08 (![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A)) <=> ![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 1.32/1.08 inference(quant_intro,[status(thm)],[11])).
% 1.32/1.08 tff(13,plain,
% 1.32/1.08 (![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A)) <=> ![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 1.32/1.08 inference(rewrite,[status(thm)],[])).
% 1.32/1.08 tff(14,axiom,(![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','commutativity_k2_xboole_0')).
% 1.32/1.08 tff(15,plain,
% 1.32/1.08 (![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[14, 13])).
% 1.32/1.08 tff(16,plain,(
% 1.32/1.08 ![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 1.32/1.08 inference(skolemize,[status(sab)],[15])).
% 1.32/1.08 tff(17,plain,
% 1.32/1.08 (![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[16, 12])).
% 1.32/1.08 tff(18,plain,
% 1.32/1.08 ((~![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))) | (set_union2(A!73, singleton(A!73)) = set_union2(singleton(A!73), A!73))),
% 1.32/1.08 inference(quant_inst,[status(thm)],[])).
% 1.32/1.08 tff(19,plain,
% 1.32/1.08 (set_union2(A!73, singleton(A!73)) = set_union2(singleton(A!73), A!73)),
% 1.32/1.08 inference(unit_resolution,[status(thm)],[18, 17])).
% 1.32/1.08 tff(20,plain,
% 1.32/1.08 (set_union2(singleton(A!73), A!73) = set_union2(A!73, singleton(A!73))),
% 1.32/1.08 inference(symmetry,[status(thm)],[19])).
% 1.32/1.08 tff(21,plain,
% 1.32/1.08 (set_union2(singleton(A!73), A!73) = succ(A!73)),
% 1.32/1.08 inference(transitivity,[status(thm)],[20, 10])).
% 1.32/1.08 tff(22,plain,
% 1.32/1.08 (subset(singleton(A!73), set_union2(singleton(A!73), A!73)) <=> subset(singleton(A!73), succ(A!73))),
% 1.32/1.08 inference(monotonicity,[status(thm)],[21])).
% 1.32/1.08 tff(23,plain,
% 1.32/1.08 (subset(singleton(A!73), succ(A!73)) <=> subset(singleton(A!73), set_union2(singleton(A!73), A!73))),
% 1.32/1.08 inference(symmetry,[status(thm)],[22])).
% 1.32/1.08 tff(24,plain,
% 1.32/1.08 ((~subset(singleton(A!73), succ(A!73))) <=> (~subset(singleton(A!73), set_union2(singleton(A!73), A!73)))),
% 1.32/1.08 inference(monotonicity,[status(thm)],[23])).
% 1.32/1.08 tff(25,plain,
% 1.32/1.08 (^[A: $i, B: $i] : refl((subset(singleton(A), B) <=> in(A, B)) <=> (subset(singleton(A), B) <=> in(A, B)))),
% 1.32/1.08 inference(bind,[status(th)],[])).
% 1.32/1.08 tff(26,plain,
% 1.32/1.08 (![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B)) <=> ![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 1.32/1.08 inference(quant_intro,[status(thm)],[25])).
% 1.32/1.08 tff(27,plain,
% 1.32/1.08 (![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B)) <=> ![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 1.32/1.08 inference(rewrite,[status(thm)],[])).
% 1.32/1.08 tff(28,axiom,(![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','l2_zfmisc_1')).
% 1.32/1.08 tff(29,plain,
% 1.32/1.08 (![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[28, 27])).
% 1.32/1.08 tff(30,plain,(
% 1.32/1.08 ![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 1.32/1.08 inference(skolemize,[status(sab)],[29])).
% 1.32/1.08 tff(31,plain,
% 1.32/1.08 (![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[30, 26])).
% 1.32/1.08 tff(32,plain,
% 1.32/1.08 ((~![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))) | (subset(singleton(A!73), succ(A!73)) <=> in(A!73, succ(A!73)))),
% 1.32/1.08 inference(quant_inst,[status(thm)],[])).
% 1.32/1.08 tff(33,plain,
% 1.32/1.08 (subset(singleton(A!73), succ(A!73)) <=> in(A!73, succ(A!73))),
% 1.32/1.08 inference(unit_resolution,[status(thm)],[32, 31])).
% 1.32/1.08 tff(34,plain,
% 1.32/1.08 ((~![A: $i] : in(A, succ(A))) <=> (~![A: $i] : in(A, succ(A)))),
% 1.32/1.08 inference(rewrite,[status(thm)],[])).
% 1.32/1.08 tff(35,axiom,(~![A: $i] : in(A, succ(A))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','t10_ordinal1')).
% 1.32/1.08 tff(36,plain,
% 1.32/1.08 (~![A: $i] : in(A, succ(A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[35, 34])).
% 1.32/1.08 tff(37,plain,
% 1.32/1.08 (~![A: $i] : in(A, succ(A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[36, 34])).
% 1.32/1.08 tff(38,plain,
% 1.32/1.08 (~![A: $i] : in(A, succ(A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[37, 34])).
% 1.32/1.08 tff(39,plain,
% 1.32/1.08 (~![A: $i] : in(A, succ(A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[38, 34])).
% 1.32/1.08 tff(40,plain,
% 1.32/1.08 (~![A: $i] : in(A, succ(A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[39, 34])).
% 1.32/1.08 tff(41,plain,
% 1.32/1.08 (~![A: $i] : in(A, succ(A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[40, 34])).
% 1.32/1.08 tff(42,plain,
% 1.32/1.08 (~![A: $i] : in(A, succ(A))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[41, 34])).
% 1.32/1.08 tff(43,plain,(
% 1.32/1.08 ~in(A!73, succ(A!73))),
% 1.32/1.08 inference(skolemize,[status(sab)],[42])).
% 1.32/1.08 tff(44,plain,
% 1.32/1.08 ((~(subset(singleton(A!73), succ(A!73)) <=> in(A!73, succ(A!73)))) | (~subset(singleton(A!73), succ(A!73))) | in(A!73, succ(A!73))),
% 1.32/1.08 inference(tautology,[status(thm)],[])).
% 1.32/1.08 tff(45,plain,
% 1.32/1.08 ((~(subset(singleton(A!73), succ(A!73)) <=> in(A!73, succ(A!73)))) | (~subset(singleton(A!73), succ(A!73)))),
% 1.32/1.08 inference(unit_resolution,[status(thm)],[44, 43])).
% 1.32/1.08 tff(46,plain,
% 1.32/1.08 (~subset(singleton(A!73), succ(A!73))),
% 1.32/1.08 inference(unit_resolution,[status(thm)],[45, 33])).
% 1.32/1.08 tff(47,plain,
% 1.32/1.08 (~subset(singleton(A!73), set_union2(singleton(A!73), A!73))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[46, 24])).
% 1.32/1.08 tff(48,plain,
% 1.32/1.08 (^[A: $i, B: $i] : refl(subset(A, set_union2(A, B)) <=> subset(A, set_union2(A, B)))),
% 1.32/1.08 inference(bind,[status(th)],[])).
% 1.32/1.08 tff(49,plain,
% 1.32/1.08 (![A: $i, B: $i] : subset(A, set_union2(A, B)) <=> ![A: $i, B: $i] : subset(A, set_union2(A, B))),
% 1.32/1.08 inference(quant_intro,[status(thm)],[48])).
% 1.32/1.08 tff(50,plain,
% 1.32/1.08 (![A: $i, B: $i] : subset(A, set_union2(A, B)) <=> ![A: $i, B: $i] : subset(A, set_union2(A, B))),
% 1.32/1.08 inference(rewrite,[status(thm)],[])).
% 1.32/1.08 tff(51,axiom,(![A: $i, B: $i] : subset(A, set_union2(A, B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','t7_xboole_1')).
% 1.32/1.08 tff(52,plain,
% 1.32/1.08 (![A: $i, B: $i] : subset(A, set_union2(A, B))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[51, 50])).
% 1.32/1.08 tff(53,plain,(
% 1.32/1.08 ![A: $i, B: $i] : subset(A, set_union2(A, B))),
% 1.32/1.08 inference(skolemize,[status(sab)],[52])).
% 1.32/1.08 tff(54,plain,
% 1.32/1.08 (![A: $i, B: $i] : subset(A, set_union2(A, B))),
% 1.32/1.08 inference(modus_ponens,[status(thm)],[53, 49])).
% 1.32/1.08 tff(55,plain,
% 1.32/1.08 ((~![A: $i, B: $i] : subset(A, set_union2(A, B))) | subset(singleton(A!73), set_union2(singleton(A!73), A!73))),
% 1.32/1.08 inference(quant_inst,[status(thm)],[])).
% 1.32/1.08 tff(56,plain,
% 1.32/1.08 (subset(singleton(A!73), set_union2(singleton(A!73), A!73))),
% 1.32/1.09 inference(unit_resolution,[status(thm)],[55, 54])).
% 1.32/1.09 tff(57,plain,
% 1.32/1.09 ($false),
% 1.32/1.09 inference(unit_resolution,[status(thm)],[56, 47])).
% 1.32/1.09 % SZS output end Proof
%------------------------------------------------------------------------------