TSTP Solution File: SYN360+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN360+1 : TPTP v8.1.0. Released v2.0.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 : Thu Sep 29 23:54:58 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN360+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n007.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 : Mon Sep 5 02:38:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.20/0.39 % SZS status Theorem
% 0.20/0.39 % SZS output start Proof
% 0.20/0.39 tff(big_p_type, type, (
% 0.20/0.39 big_p: ( $i * $i ) > $o)).
% 0.20/0.39 tff(tptp_fun_Y_0_type, type, (
% 0.20/0.39 tptp_fun_Y_0: $i > $i)).
% 0.20/0.39 tff(tptp_fun_X_1_type, type, (
% 0.20/0.39 tptp_fun_X_1: $i)).
% 0.20/0.39 tff(big_q_type, type, (
% 0.20/0.39 big_q: ( $i * $i ) > $o)).
% 0.20/0.39 tff(tptp_fun_Y_2_type, type, (
% 0.20/0.39 tptp_fun_Y_2: $i)).
% 0.20/0.39 tff(1,plain,
% 0.20/0.39 (![Z: $i] : ?[Y: $i] : big_p(Z, Y) <=> ![Z: $i] : ?[Y: $i] : big_p(Z, Y)),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(2,plain,
% 0.20/0.39 ((~((![X: $i] : (?[Y: $i] : big_p(X, Y) => ![Y: $i] : big_q(X, Y)) & ![Z: $i] : ?[Y: $i] : big_p(Z, Y)) => ![Y: $i, X: $i] : big_q(X, Y))) <=> (~((~(![X: $i] : ((~?[Y: $i] : big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) & ![Z: $i] : ?[Y: $i] : big_p(Z, Y))) | ![Y: $i, X: $i] : big_q(X, Y)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(3,axiom,(~((![X: $i] : (?[Y: $i] : big_p(X, Y) => ![Y: $i] : big_q(X, Y)) & ![Z: $i] : ?[Y: $i] : big_p(Z, Y)) => ![Y: $i, X: $i] : big_q(X, Y))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','x2111')).
% 0.20/0.39 tff(4,plain,
% 0.20/0.39 (~((~(![X: $i] : ((~?[Y: $i] : big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) & ![Z: $i] : ?[Y: $i] : big_p(Z, Y))) | ![Y: $i, X: $i] : big_q(X, Y))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.20/0.39 tff(5,plain,
% 0.20/0.39 (![X: $i] : ((~?[Y: $i] : big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) & ![Z: $i] : ?[Y: $i] : big_p(Z, Y)),
% 0.20/0.39 inference(or_elim,[status(thm)],[4])).
% 0.20/0.39 tff(6,plain,
% 0.20/0.39 (![Z: $i] : ?[Y: $i] : big_p(Z, Y)),
% 0.20/0.39 inference(and_elim,[status(thm)],[5])).
% 0.20/0.39 tff(7,plain,
% 0.20/0.39 (![Z: $i] : ?[Y: $i] : big_p(Z, Y)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[6, 1])).
% 0.20/0.39 tff(8,plain,(
% 0.20/0.39 ![Z: $i] : big_p(Z, tptp_fun_Y_0(Z))),
% 0.20/0.39 inference(skolemize,[status(sab)],[7])).
% 0.20/0.39 tff(9,plain,
% 0.20/0.39 ((~![Z: $i] : big_p(Z, tptp_fun_Y_0(Z))) | big_p(X!1, tptp_fun_Y_0(X!1))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(10,plain,
% 0.20/0.39 (big_p(X!1, tptp_fun_Y_0(X!1))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[9, 8])).
% 0.20/0.39 tff(11,plain,
% 0.20/0.39 ((~![Y: $i, X: $i] : big_q(X, Y)) <=> (~![Y: $i, X: $i] : big_q(X, Y))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(12,plain,
% 0.20/0.39 (~![Y: $i, X: $i] : big_q(X, Y)),
% 0.20/0.39 inference(or_elim,[status(thm)],[4])).
% 0.20/0.39 tff(13,plain,
% 0.20/0.39 (~![Y: $i, X: $i] : big_q(X, Y)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[12, 11])).
% 0.20/0.39 tff(14,plain,
% 0.20/0.39 (~![Y: $i, X: $i] : big_q(X, Y)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[13, 11])).
% 0.20/0.39 tff(15,plain,
% 0.20/0.39 (~![Y: $i, X: $i] : big_q(X, Y)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[14, 11])).
% 0.20/0.39 tff(16,plain,
% 0.20/0.39 (~![Y: $i, X: $i] : big_q(X, Y)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[15, 11])).
% 0.20/0.39 tff(17,plain,
% 0.20/0.39 (~![Y: $i, X: $i] : big_q(X, Y)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[16, 11])).
% 0.20/0.39 tff(18,plain,
% 0.20/0.39 (~![Y: $i, X: $i] : big_q(X, Y)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[17, 11])).
% 0.20/0.39 tff(19,plain,(
% 0.20/0.39 ~big_q(X!1, Y!2)),
% 0.20/0.39 inference(skolemize,[status(sab)],[18])).
% 0.20/0.39 tff(20,plain,
% 0.20/0.39 (^[X: $i, Y_3: $i, Y: $i] : refl(((~big_p(X, Y)) | big_q(X, Y_3)) <=> ((~big_p(X, Y)) | big_q(X, Y_3)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(21,plain,
% 0.20/0.39 (![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3)) <=> ![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[20])).
% 0.20/0.39 tff(22,plain,
% 0.20/0.39 (![X: $i] : ![Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3)) <=> ![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))),
% 0.20/0.39 inference(pull_quant,[status(thm)],[])).
% 0.20/0.39 tff(23,plain,
% 0.20/0.39 (^[X: $i] : pull_quant((![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) <=> ![Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(24,plain,
% 0.20/0.39 (![X: $i] : (![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) <=> ![X: $i] : ![Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[23])).
% 0.20/0.39 tff(25,plain,
% 0.20/0.39 (![X: $i] : (![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) <=> ![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))),
% 0.20/0.39 inference(transitivity,[status(thm)],[24, 22])).
% 0.20/0.39 tff(26,plain,
% 0.20/0.39 (![X: $i] : (![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) <=> ![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))),
% 0.20/0.39 inference(transitivity,[status(thm)],[25, 21])).
% 0.20/0.39 tff(27,plain,
% 0.20/0.39 (^[X: $i] : rewrite((![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) <=> (![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(28,plain,
% 0.20/0.39 (![X: $i] : (![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) <=> ![X: $i] : (![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[27])).
% 0.20/0.39 tff(29,plain,
% 0.20/0.39 (![X: $i] : (![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) <=> ![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))),
% 0.20/0.39 inference(transitivity,[status(thm)],[28, 26])).
% 0.20/0.39 tff(30,plain,
% 0.20/0.39 (![X: $i] : ((~?[Y: $i] : big_p(X, Y)) | ![Y: $i] : big_q(X, Y)) <=> ![X: $i] : ((~?[Y: $i] : big_p(X, Y)) | ![Y: $i] : big_q(X, Y))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(31,plain,
% 0.20/0.39 (![X: $i] : ((~?[Y: $i] : big_p(X, Y)) | ![Y: $i] : big_q(X, Y))),
% 0.20/0.39 inference(and_elim,[status(thm)],[5])).
% 0.20/0.39 tff(32,plain,
% 0.20/0.39 (![X: $i] : ((~?[Y: $i] : big_p(X, Y)) | ![Y: $i] : big_q(X, Y))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[31, 30])).
% 0.20/0.39 tff(33,plain,(
% 0.20/0.39 ![X: $i] : (![Y: $i] : (~big_p(X, Y)) | ![Y: $i] : big_q(X, Y))),
% 0.20/0.39 inference(skolemize,[status(sab)],[32])).
% 0.20/0.39 tff(34,plain,
% 0.20/0.39 (![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[33, 29])).
% 0.20/0.39 tff(35,plain,
% 0.20/0.39 (((~![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))) | ((~big_p(X!1, tptp_fun_Y_0(X!1))) | big_q(X!1, Y!2))) <=> ((~![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))) | (~big_p(X!1, tptp_fun_Y_0(X!1))) | big_q(X!1, Y!2))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(36,plain,
% 0.20/0.39 ((~![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))) | ((~big_p(X!1, tptp_fun_Y_0(X!1))) | big_q(X!1, Y!2))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(37,plain,
% 0.20/0.39 ((~![X: $i, Y_3: $i, Y: $i] : ((~big_p(X, Y)) | big_q(X, Y_3))) | (~big_p(X!1, tptp_fun_Y_0(X!1))) | big_q(X!1, Y!2)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[36, 35])).
% 0.20/0.39 tff(38,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[37, 34, 19, 10])).
% 0.20/0.39 % SZS output end Proof
%------------------------------------------------------------------------------