TSTP Solution File: SEU152+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n009.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:48 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33 % Computer : n009.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Sep 3 09:40:35 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.37 % SZS status Theorem
% 0.19/0.37 % SZS output start Proof
% 0.19/0.37 tff(in_type, type, (
% 0.19/0.37 in: ( $i * $i ) > $o)).
% 0.19/0.37 tff(tptp_fun_B_0_type, type, (
% 0.19/0.37 tptp_fun_B_0: $i)).
% 0.19/0.37 tff(tptp_fun_A_1_type, type, (
% 0.19/0.37 tptp_fun_A_1: $i)).
% 0.19/0.37 tff(subset_type, type, (
% 0.19/0.37 subset: ( $i * $i ) > $o)).
% 0.19/0.37 tff(singleton_type, type, (
% 0.19/0.37 singleton: $i > $i)).
% 0.19/0.37 tff(set_union2_type, type, (
% 0.19/0.37 set_union2: ( $i * $i ) > $i)).
% 0.19/0.37 tff(1,plain,
% 0.19/0.37 (^[A: $i, B: $i] : refl((subset(singleton(A), B) <=> in(A, B)) <=> (subset(singleton(A), B) <=> in(A, B)))),
% 0.19/0.37 inference(bind,[status(th)],[])).
% 0.19/0.37 tff(2,plain,
% 0.19/0.37 (![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B)) <=> ![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 0.19/0.37 inference(quant_intro,[status(thm)],[1])).
% 0.19/0.37 tff(3,plain,
% 0.19/0.37 (![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B)) <=> ![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 0.19/0.37 inference(rewrite,[status(thm)],[])).
% 0.19/0.37 tff(4,axiom,(![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','l2_zfmisc_1')).
% 0.19/0.37 tff(5,plain,
% 0.19/0.37 (![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 0.19/0.37 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.19/0.37 tff(6,plain,(
% 0.19/0.37 ![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 0.19/0.37 inference(skolemize,[status(sab)],[5])).
% 0.19/0.37 tff(7,plain,
% 0.19/0.37 (![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))),
% 0.19/0.37 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.19/0.37 tff(8,plain,
% 0.19/0.37 ((~![A: $i, B: $i] : (subset(singleton(A), B) <=> in(A, B))) | (subset(singleton(A!1), B!0) <=> in(A!1, B!0))),
% 0.19/0.37 inference(quant_inst,[status(thm)],[])).
% 0.19/0.37 tff(9,plain,
% 0.19/0.37 (subset(singleton(A!1), B!0) <=> in(A!1, B!0)),
% 0.19/0.37 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.19/0.37 tff(10,plain,
% 0.19/0.37 (^[A: $i, B: $i] : refl(((~subset(A, B)) | (set_union2(A, B) = B)) <=> ((~subset(A, B)) | (set_union2(A, B) = B)))),
% 0.19/0.37 inference(bind,[status(th)],[])).
% 0.19/0.37 tff(11,plain,
% 0.19/0.37 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B)) <=> ![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.19/0.37 inference(quant_intro,[status(thm)],[10])).
% 0.19/0.37 tff(12,plain,
% 0.19/0.37 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B)) <=> ![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.19/0.37 inference(rewrite,[status(thm)],[])).
% 0.19/0.37 tff(13,plain,
% 0.19/0.37 (^[A: $i, B: $i] : rewrite((subset(A, B) => (set_union2(A, B) = B)) <=> ((~subset(A, B)) | (set_union2(A, B) = B)))),
% 0.19/0.37 inference(bind,[status(th)],[])).
% 0.19/0.37 tff(14,plain,
% 0.19/0.37 (![A: $i, B: $i] : (subset(A, B) => (set_union2(A, B) = B)) <=> ![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.19/0.37 inference(quant_intro,[status(thm)],[13])).
% 0.19/0.37 tff(15,axiom,(![A: $i, B: $i] : (subset(A, B) => (set_union2(A, B) = B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','t12_xboole_1')).
% 0.19/0.37 tff(16,plain,
% 0.19/0.37 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.19/0.37 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.19/0.37 tff(17,plain,
% 0.19/0.37 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.19/0.37 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.19/0.37 tff(18,plain,(
% 0.19/0.37 ![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.19/0.37 inference(skolemize,[status(sab)],[17])).
% 0.19/0.37 tff(19,plain,
% 0.19/0.37 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.19/0.37 inference(modus_ponens,[status(thm)],[18, 11])).
% 0.19/0.37 tff(20,plain,
% 0.19/0.37 ((~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B))) <=> (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B)))),
% 0.19/0.37 inference(rewrite,[status(thm)],[])).
% 0.19/0.37 tff(21,plain,
% 0.19/0.37 ((~![A: $i, B: $i] : (in(A, B) => (set_union2(singleton(A), B) = B))) <=> (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B)))),
% 0.19/0.37 inference(rewrite,[status(thm)],[])).
% 0.19/0.37 tff(22,axiom,(~![A: $i, B: $i] : (in(A, B) => (set_union2(singleton(A), B) = B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','l23_zfmisc_1')).
% 0.19/0.37 tff(23,plain,
% 0.19/0.37 (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B))),
% 0.19/0.37 inference(modus_ponens,[status(thm)],[22, 21])).
% 0.19/0.37 tff(24,plain,
% 0.19/0.37 (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B))),
% 0.19/0.38 inference(modus_ponens,[status(thm)],[23, 20])).
% 0.19/0.38 tff(25,plain,
% 0.19/0.38 (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B))),
% 0.19/0.38 inference(modus_ponens,[status(thm)],[24, 20])).
% 0.19/0.38 tff(26,plain,
% 0.19/0.38 (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B))),
% 0.19/0.38 inference(modus_ponens,[status(thm)],[25, 20])).
% 0.19/0.38 tff(27,plain,
% 0.19/0.38 (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B))),
% 0.19/0.38 inference(modus_ponens,[status(thm)],[26, 20])).
% 0.19/0.38 tff(28,plain,
% 0.19/0.38 (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B))),
% 0.19/0.38 inference(modus_ponens,[status(thm)],[27, 20])).
% 0.19/0.38 tff(29,plain,
% 0.19/0.38 (~![A: $i, B: $i] : ((~in(A, B)) | (set_union2(singleton(A), B) = B))),
% 0.19/0.38 inference(modus_ponens,[status(thm)],[28, 20])).
% 0.19/0.38 tff(30,plain,(
% 0.19/0.38 ~((~in(A!1, B!0)) | (set_union2(singleton(A!1), B!0) = B!0))),
% 0.19/0.38 inference(skolemize,[status(sab)],[29])).
% 0.19/0.38 tff(31,plain,
% 0.19/0.38 (~(set_union2(singleton(A!1), B!0) = B!0)),
% 0.19/0.38 inference(or_elim,[status(thm)],[30])).
% 0.19/0.38 tff(32,plain,
% 0.19/0.38 (((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) | ((~subset(singleton(A!1), B!0)) | (set_union2(singleton(A!1), B!0) = B!0))) <=> ((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) | (~subset(singleton(A!1), B!0)) | (set_union2(singleton(A!1), B!0) = B!0))),
% 0.19/0.38 inference(rewrite,[status(thm)],[])).
% 0.19/0.38 tff(33,plain,
% 0.19/0.38 ((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) | ((~subset(singleton(A!1), B!0)) | (set_union2(singleton(A!1), B!0) = B!0))),
% 0.19/0.38 inference(quant_inst,[status(thm)],[])).
% 0.19/0.38 tff(34,plain,
% 0.19/0.38 ((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) | (~subset(singleton(A!1), B!0)) | (set_union2(singleton(A!1), B!0) = B!0)),
% 0.19/0.38 inference(modus_ponens,[status(thm)],[33, 32])).
% 0.19/0.38 tff(35,plain,
% 0.19/0.38 (~subset(singleton(A!1), B!0)),
% 0.19/0.38 inference(unit_resolution,[status(thm)],[34, 31, 19])).
% 0.19/0.38 tff(36,plain,
% 0.19/0.38 (in(A!1, B!0)),
% 0.19/0.38 inference(or_elim,[status(thm)],[30])).
% 0.19/0.38 tff(37,plain,
% 0.19/0.38 ((~(subset(singleton(A!1), B!0) <=> in(A!1, B!0))) | subset(singleton(A!1), B!0) | (~in(A!1, B!0))),
% 0.19/0.38 inference(tautology,[status(thm)],[])).
% 0.19/0.38 tff(38,plain,
% 0.19/0.38 ((~(subset(singleton(A!1), B!0) <=> in(A!1, B!0))) | subset(singleton(A!1), B!0)),
% 0.19/0.38 inference(unit_resolution,[status(thm)],[37, 36])).
% 0.19/0.38 tff(39,plain,
% 0.19/0.38 ($false),
% 0.19/0.38 inference(unit_resolution,[status(thm)],[38, 35, 9])).
% 0.19/0.38 % SZS output end Proof
%------------------------------------------------------------------------------