TSTP Solution File: SYN721+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN721+1 : TPTP v8.1.0. Released v2.5.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 : Thu Sep 29 23:57:04 EDT 2022
% Result : Theorem 0.19s 0.39s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SYN721+1 : TPTP v8.1.0. Released v2.5.0.
% 0.02/0.12 % 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.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Sep 5 06:42: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.39 % SZS status Theorem
% 0.19/0.39 % SZS output start Proof
% 0.19/0.39 tff(r_type, type, (
% 0.19/0.39 r: ( $i * $i ) > $o)).
% 0.19/0.39 tff(a_type, type, (
% 0.19/0.39 a: $i)).
% 0.19/0.39 tff(q_type, type, (
% 0.19/0.39 q: ( $i * $i ) > $o)).
% 0.19/0.39 tff(b_type, type, (
% 0.19/0.39 b: $i)).
% 0.19/0.39 tff(1,assumption,(![Y: $i] : (~r(a, Y))), introduced(assumption)).
% 0.19/0.39 tff(2,plain,
% 0.19/0.39 (r(a, b) <=> r(a, b)),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(3,plain,
% 0.19/0.39 ((~(((r(a, b) & ![X: $i] : (?[Y: $i] : r(X, Y) => q(X, X))) & ![U: $i, V: $i] : (q(U, V) => ![Z: $i] : r(Z, V))) => ?[W: $i] : (r(b, W) & q(W, a)))) <=> (~((~(r(a, b) & ![X: $i] : ((~?[Y: $i] : r(X, Y)) | q(X, X)) & ![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V)))) | ?[W: $i] : (r(b, W) & q(W, a))))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(4,axiom,(~(((r(a, b) & ![X: $i] : (?[Y: $i] : r(X, Y) => q(X, X))) & ![U: $i, V: $i] : (q(U, V) => ![Z: $i] : r(Z, V))) => ?[W: $i] : (r(b, W) & q(W, a)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','lx1')).
% 0.19/0.39 tff(5,plain,
% 0.19/0.39 (~((~(r(a, b) & ![X: $i] : ((~?[Y: $i] : r(X, Y)) | q(X, X)) & ![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V)))) | ?[W: $i] : (r(b, W) & q(W, a)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.19/0.39 tff(6,plain,
% 0.19/0.39 (r(a, b) & ![X: $i] : ((~?[Y: $i] : r(X, Y)) | q(X, X)) & ![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(or_elim,[status(thm)],[5])).
% 0.19/0.39 tff(7,plain,
% 0.19/0.39 (r(a, b)),
% 0.19/0.39 inference(and_elim,[status(thm)],[6])).
% 0.19/0.39 tff(8,plain,
% 0.19/0.39 (r(a, b)),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[7, 2])).
% 0.19/0.39 tff(9,plain,
% 0.19/0.39 ((~![Y: $i] : (~r(a, Y))) | (~r(a, b))),
% 0.19/0.39 inference(quant_inst,[status(thm)],[])).
% 0.19/0.39 tff(10,plain,
% 0.19/0.39 ($false),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[9, 8, 1])).
% 0.19/0.39 tff(11,plain,(~![Y: $i] : (~r(a, Y))), inference(lemma,lemma(discharge,[]))).
% 0.19/0.39 tff(12,plain,
% 0.19/0.39 (^[X: $i] : refl((q(X, X) | ![Y: $i] : (~r(X, Y))) <=> (q(X, X) | ![Y: $i] : (~r(X, Y))))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(13,plain,
% 0.19/0.39 (![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y))) <=> ![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[12])).
% 0.19/0.39 tff(14,plain,
% 0.19/0.39 (^[X: $i] : rewrite((q(X, X) | ![Y: $i] : (~r(X, Y))) <=> (q(X, X) | ![Y: $i] : (~r(X, Y))))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(15,plain,
% 0.19/0.39 (![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y))) <=> ![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[14])).
% 0.19/0.39 tff(16,plain,
% 0.19/0.39 (![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y))) <=> ![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))),
% 0.19/0.39 inference(transitivity,[status(thm)],[15, 13])).
% 0.19/0.39 tff(17,plain,
% 0.19/0.39 (^[X: $i] : rewrite((![Y: $i] : (~r(X, Y)) | q(X, X)) <=> (q(X, X) | ![Y: $i] : (~r(X, Y))))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(18,plain,
% 0.19/0.39 (![X: $i] : (![Y: $i] : (~r(X, Y)) | q(X, X)) <=> ![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[17])).
% 0.19/0.39 tff(19,plain,
% 0.19/0.39 (![X: $i] : ((~?[Y: $i] : r(X, Y)) | q(X, X)) <=> ![X: $i] : ((~?[Y: $i] : r(X, Y)) | q(X, X))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(20,plain,
% 0.19/0.39 (![X: $i] : ((~?[Y: $i] : r(X, Y)) | q(X, X))),
% 0.19/0.39 inference(and_elim,[status(thm)],[6])).
% 0.19/0.39 tff(21,plain,
% 0.19/0.39 (![X: $i] : ((~?[Y: $i] : r(X, Y)) | q(X, X))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[20, 19])).
% 0.19/0.39 tff(22,plain,(
% 0.19/0.39 ![X: $i] : (![Y: $i] : (~r(X, Y)) | q(X, X))),
% 0.19/0.39 inference(skolemize,[status(sab)],[21])).
% 0.19/0.39 tff(23,plain,
% 0.19/0.39 (![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[22, 18])).
% 0.19/0.39 tff(24,plain,
% 0.19/0.39 (![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[23, 16])).
% 0.19/0.39 tff(25,plain,
% 0.19/0.39 (((~![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))) | (q(a, a) | ![Y: $i] : (~r(a, Y)))) <=> ((~![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))) | q(a, a) | ![Y: $i] : (~r(a, Y)))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(26,plain,
% 0.19/0.39 ((~![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))) | (q(a, a) | ![Y: $i] : (~r(a, Y)))),
% 0.19/0.39 inference(quant_inst,[status(thm)],[])).
% 0.19/0.39 tff(27,plain,
% 0.19/0.39 ((~![X: $i] : (q(X, X) | ![Y: $i] : (~r(X, Y)))) | q(a, a) | ![Y: $i] : (~r(a, Y))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[26, 25])).
% 0.19/0.39 tff(28,plain,
% 0.19/0.39 (q(a, a) | ![Y: $i] : (~r(a, Y))),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[27, 24])).
% 0.19/0.39 tff(29,plain,
% 0.19/0.39 (q(a, a)),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[28, 11])).
% 0.19/0.39 tff(30,plain,
% 0.19/0.39 (^[U: $i, V: $i] : refl(((~q(U, V)) | ![Z: $i] : r(Z, V)) <=> ((~q(U, V)) | ![Z: $i] : r(Z, V)))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(31,plain,
% 0.19/0.39 (![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V)) <=> ![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[30])).
% 0.19/0.39 tff(32,plain,
% 0.19/0.39 (^[U: $i, V: $i] : rewrite(((~q(U, V)) | ![Z: $i] : r(Z, V)) <=> ((~q(U, V)) | ![Z: $i] : r(Z, V)))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(33,plain,
% 0.19/0.39 (![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V)) <=> ![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[32])).
% 0.19/0.39 tff(34,plain,
% 0.19/0.39 (![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V)) <=> ![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(transitivity,[status(thm)],[33, 31])).
% 0.19/0.39 tff(35,plain,
% 0.19/0.39 (![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V)) <=> ![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(36,plain,
% 0.19/0.39 (![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(and_elim,[status(thm)],[6])).
% 0.19/0.39 tff(37,plain,
% 0.19/0.39 (![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[36, 35])).
% 0.19/0.39 tff(38,plain,(
% 0.19/0.39 ![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(skolemize,[status(sab)],[37])).
% 0.19/0.39 tff(39,plain,
% 0.19/0.39 (![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[38, 34])).
% 0.19/0.39 tff(40,plain,
% 0.19/0.39 (((~![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))) | ((~q(a, a)) | ![Z: $i] : r(Z, a))) <=> ((~![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))) | (~q(a, a)) | ![Z: $i] : r(Z, a))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(41,plain,
% 0.19/0.39 ((~![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))) | ((~q(a, a)) | ![Z: $i] : r(Z, a))),
% 0.19/0.39 inference(quant_inst,[status(thm)],[])).
% 0.19/0.39 tff(42,plain,
% 0.19/0.39 ((~![U: $i, V: $i] : ((~q(U, V)) | ![Z: $i] : r(Z, V))) | (~q(a, a)) | ![Z: $i] : r(Z, a)),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[41, 40])).
% 0.19/0.39 tff(43,plain,
% 0.19/0.39 (![Z: $i] : r(Z, a)),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[42, 39, 29])).
% 0.19/0.39 tff(44,plain,
% 0.19/0.39 (^[W: $i] : refl(((~r(b, W)) | (~q(W, a))) <=> ((~r(b, W)) | (~q(W, a))))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(45,plain,
% 0.19/0.39 (![W: $i] : ((~r(b, W)) | (~q(W, a))) <=> ![W: $i] : ((~r(b, W)) | (~q(W, a)))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[44])).
% 0.19/0.39 tff(46,plain,
% 0.19/0.39 (^[W: $i] : trans(monotonicity(rewrite((r(b, W) & q(W, a)) <=> (~((~r(b, W)) | (~q(W, a))))), ((~(r(b, W) & q(W, a))) <=> (~(~((~r(b, W)) | (~q(W, a))))))), rewrite((~(~((~r(b, W)) | (~q(W, a))))) <=> ((~r(b, W)) | (~q(W, a)))), ((~(r(b, W) & q(W, a))) <=> ((~r(b, W)) | (~q(W, a)))))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(47,plain,
% 0.19/0.39 (![W: $i] : (~(r(b, W) & q(W, a))) <=> ![W: $i] : ((~r(b, W)) | (~q(W, a)))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[46])).
% 0.19/0.39 tff(48,plain,
% 0.19/0.39 ((~?[W: $i] : (r(b, W) & q(W, a))) <=> (~?[W: $i] : (r(b, W) & q(W, a)))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(49,plain,
% 0.19/0.39 (~?[W: $i] : (r(b, W) & q(W, a))),
% 0.19/0.39 inference(or_elim,[status(thm)],[5])).
% 0.19/0.39 tff(50,plain,
% 0.19/0.39 (~?[W: $i] : (r(b, W) & q(W, a))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[49, 48])).
% 0.19/0.39 tff(51,plain,
% 0.19/0.39 (~?[W: $i] : (r(b, W) & q(W, a))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[50, 48])).
% 0.19/0.39 tff(52,plain,
% 0.19/0.39 (~?[W: $i] : (r(b, W) & q(W, a))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[51, 48])).
% 0.19/0.39 tff(53,plain,
% 0.19/0.39 (~?[W: $i] : (r(b, W) & q(W, a))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[52, 48])).
% 0.19/0.39 tff(54,plain,
% 0.19/0.39 (~?[W: $i] : (r(b, W) & q(W, a))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[53, 48])).
% 0.19/0.39 tff(55,plain,
% 0.19/0.39 (~?[W: $i] : (r(b, W) & q(W, a))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[54, 48])).
% 0.19/0.39 tff(56,plain,
% 0.19/0.39 (^[W: $i] : refl($oeq((~(r(b, W) & q(W, a))), (~(r(b, W) & q(W, a)))))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(57,plain,(
% 0.19/0.39 ![W: $i] : (~(r(b, W) & q(W, a)))),
% 0.19/0.39 inference(nnf-neg,[status(sab)],[55, 56])).
% 0.19/0.39 tff(58,plain,
% 0.19/0.39 (![W: $i] : ((~r(b, W)) | (~q(W, a)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[57, 47])).
% 0.19/0.39 tff(59,plain,
% 0.19/0.39 (![W: $i] : ((~r(b, W)) | (~q(W, a)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[58, 45])).
% 0.19/0.39 tff(60,plain,
% 0.19/0.39 (((~![W: $i] : ((~r(b, W)) | (~q(W, a)))) | ((~r(b, a)) | (~q(a, a)))) <=> ((~![W: $i] : ((~r(b, W)) | (~q(W, a)))) | (~r(b, a)) | (~q(a, a)))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(61,plain,
% 0.19/0.39 ((~![W: $i] : ((~r(b, W)) | (~q(W, a)))) | ((~r(b, a)) | (~q(a, a)))),
% 0.19/0.39 inference(quant_inst,[status(thm)],[])).
% 0.19/0.39 tff(62,plain,
% 0.19/0.39 ((~![W: $i] : ((~r(b, W)) | (~q(W, a)))) | (~r(b, a)) | (~q(a, a))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[61, 60])).
% 0.19/0.39 tff(63,plain,
% 0.19/0.39 (~r(b, a)),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[62, 59, 29])).
% 0.19/0.39 tff(64,plain,
% 0.19/0.39 ((~![Z: $i] : r(Z, a)) | r(b, a)),
% 0.19/0.39 inference(quant_inst,[status(thm)],[])).
% 0.19/0.39 tff(65,plain,
% 0.19/0.39 ($false),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[64, 63, 43])).
% 0.19/0.39 % SZS output end Proof
%------------------------------------------------------------------------------