TSTP Solution File: SWW592_2 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWW592_2 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n002.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 : Thu Sep 29 20:59:23 EDT 2022
% Result : Theorem 0.20s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW592_2 : TPTP v8.1.0. Released v6.1.0.
% 0.07/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n002.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 : Sun Sep 4 20:24:48 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.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 % SZS output start Proof
% 0.20/0.41 tff(mk_t1_type, type, (
% 0.20/0.41 mk_t1: ( $int * $int * $int * $int ) > t1)).
% 0.20/0.41 tff(power1_type, type, (
% 0.20/0.41 power1: ( t1 * $int ) > t1)).
% 0.20/0.41 tff(tptp_fun_N_0_type, type, (
% 0.20/0.41 tptp_fun_N_0: $int)).
% 0.20/0.41 tff(1,plain,
% 0.20/0.41 (^[X: t1] : refl((power1(X, 0) = mk_t1(1, 0, 0, 1)) <=> (power1(X, 0) = mk_t1(1, 0, 0, 1)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(2,plain,
% 0.20/0.41 (![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1)) <=> ![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.41 tff(3,plain,
% 0.20/0.41 (![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1)) <=> ![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(4,axiom,(![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','power_0')).
% 0.20/0.41 tff(5,plain,
% 0.20/0.41 (![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.20/0.41 tff(6,plain,(
% 0.20/0.41 ![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1))),
% 0.20/0.41 inference(skolemize,[status(sab)],[5])).
% 0.20/0.41 tff(7,plain,
% 0.20/0.41 (![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.20/0.41 tff(8,plain,
% 0.20/0.41 ((~![X: t1] : (power1(X, 0) = mk_t1(1, 0, 0, 1))) | (power1(mk_t1(1, 1, 1, 0), 0) = mk_t1(1, 0, 0, 1))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(9,plain,
% 0.20/0.41 (power1(mk_t1(1, 1, 1, 0), 0) = mk_t1(1, 0, 0, 1)),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.20/0.41 tff(10,plain,
% 0.20/0.41 ((~((~$greatereq(N!0, 0)) | (power1(mk_t1(1, 1, 1, 0), N!0) = mk_t1(1, 0, 0, 1)) | (~(N!0 = 0)))) <=> (~((~$greatereq(N!0, 0)) | (power1(mk_t1(1, 1, 1, 0), N!0) = mk_t1(1, 0, 0, 1)) | (~(N!0 = 0))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(11,plain,
% 0.20/0.41 ((~![N: $int] : ((~$greatereq(N, 0)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))) <=> (~![N: $int] : ((~$greatereq(N, 0)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(12,plain,
% 0.20/0.41 ((~![N: $int] : ((~$lesseq(0, N)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))) <=> (~![N: $int] : ((~$greatereq(N, 0)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(13,plain,
% 0.20/0.41 ((~![N: $int] : ((~$lesseq(0, N)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))) <=> (~![N: $int] : ((~$lesseq(0, N)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(14,plain,
% 0.20/0.41 ((~![N: $int] : ($lesseq(0, N) => ((N = 0) => (power1(mk_t1(1, 1, 1, 0), N) = mk_t1($sum(1, 0), 0, 0, 1))))) <=> (~![N: $int] : ((~$lesseq(0, N)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(15,axiom,(~![N: $int] : ($lesseq(0, N) => ((N = 0) => (power1(mk_t1(1, 1, 1, 0), N) = mk_t1($sum(1, 0), 0, 0, 1))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','wP_parameter_logfib')).
% 0.20/0.41 tff(16,plain,
% 0.20/0.41 (~![N: $int] : ((~$lesseq(0, N)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.20/0.41 tff(17,plain,
% 0.20/0.41 (~![N: $int] : ((~$lesseq(0, N)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[16, 13])).
% 0.20/0.41 tff(18,plain,
% 0.20/0.41 (~![N: $int] : ((~$lesseq(0, N)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[17, 13])).
% 0.20/0.41 tff(19,plain,
% 0.20/0.41 (~![N: $int] : ((~$lesseq(0, N)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[18, 13])).
% 0.20/0.41 tff(20,plain,
% 0.20/0.41 (~![N: $int] : ((~$greatereq(N, 0)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[19, 12])).
% 0.20/0.41 tff(21,plain,
% 0.20/0.41 (~![N: $int] : ((~$greatereq(N, 0)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[20, 11])).
% 0.20/0.41 tff(22,plain,
% 0.20/0.41 (~![N: $int] : ((~$greatereq(N, 0)) | (power1(mk_t1(1, 1, 1, 0), N) = mk_t1(1, 0, 0, 1)) | (~(N = 0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[21, 11])).
% 0.20/0.41 tff(23,plain,(
% 0.20/0.41 ~((~$greatereq(N!0, 0)) | (power1(mk_t1(1, 1, 1, 0), N!0) = mk_t1(1, 0, 0, 1)) | (~(N!0 = 0)))),
% 0.20/0.41 inference(skolemize,[status(sab)],[22])).
% 0.20/0.41 tff(24,plain,
% 0.20/0.41 (~((~$greatereq(N!0, 0)) | (power1(mk_t1(1, 1, 1, 0), N!0) = mk_t1(1, 0, 0, 1)) | (~(N!0 = 0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[23, 10])).
% 0.20/0.41 tff(25,plain,
% 0.20/0.41 (N!0 = 0),
% 0.20/0.41 inference(or_elim,[status(thm)],[24])).
% 0.20/0.41 tff(26,plain,
% 0.20/0.41 (power1(mk_t1(1, 1, 1, 0), N!0) = power1(mk_t1(1, 1, 1, 0), 0)),
% 0.20/0.41 inference(monotonicity,[status(thm)],[25])).
% 0.20/0.41 tff(27,plain,
% 0.20/0.41 (power1(mk_t1(1, 1, 1, 0), N!0) = mk_t1(1, 0, 0, 1)),
% 0.20/0.41 inference(transitivity,[status(thm)],[26, 9])).
% 0.20/0.41 tff(28,plain,
% 0.20/0.41 (~(power1(mk_t1(1, 1, 1, 0), N!0) = mk_t1(1, 0, 0, 1))),
% 0.20/0.41 inference(or_elim,[status(thm)],[24])).
% 0.20/0.41 tff(29,plain,
% 0.20/0.41 ($false),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[28, 27])).
% 0.20/0.41 % SZS output end Proof
%------------------------------------------------------------------------------