TSTP Solution File: SYN054+1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SYN054+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n001.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:53:23 EDT 2022

% Result   : Theorem 0.21s 0.41s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN054+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.14  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.36  % Computer : n001.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Mon Sep  5 01:45:59 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.36  Usage: tptp [options] [-file:]file
% 0.14/0.36    -h, -?       prints this message.
% 0.14/0.36    -smt2        print SMT-LIB2 benchmark.
% 0.14/0.36    -m, -model   generate model.
% 0.14/0.36    -p, -proof   generate proof.
% 0.14/0.36    -c, -core    generate unsat core of named formulas.
% 0.14/0.36    -st, -statistics display statistics.
% 0.14/0.36    -t:timeout   set timeout (in second).
% 0.14/0.36    -smt2status  display status in smt2 format instead of SZS.
% 0.14/0.36    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.36    -<param>:<value> configuration parameter and value.
% 0.14/0.36    -o:<output-file> file to place output in.
% 0.21/0.41  % SZS status Theorem
% 0.21/0.41  % SZS output start Proof
% 0.21/0.41  tff(big_r_type, type, (
% 0.21/0.41     big_r: $i > $o)).
% 0.21/0.41  tff(tptp_fun_X_0_type, type, (
% 0.21/0.41     tptp_fun_X_0: $i)).
% 0.21/0.41  tff(big_p_type, type, (
% 0.21/0.41     big_p: $i > $o)).
% 0.21/0.41  tff(big_q_type, type, (
% 0.21/0.41     big_q: $i > $o)).
% 0.21/0.41  tff(tptp_fun_Y_1_type, type, (
% 0.21/0.41     tptp_fun_Y_1: $i)).
% 0.21/0.41  tff(big_s_type, type, (
% 0.21/0.41     big_s: $i > $o)).
% 0.21/0.41  tff(1,assumption,(big_q(Y!1)), introduced(assumption)).
% 0.21/0.41  tff(2,plain,
% 0.21/0.41      ((big_q(Y!1) | big_r(Y!1)) | (~big_q(Y!1))),
% 0.21/0.41      inference(tautology,[status(thm)],[])).
% 0.21/0.41  tff(3,plain,
% 0.21/0.41      (big_q(Y!1) | big_r(Y!1)),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[2, 1])).
% 0.21/0.41  tff(4,plain,
% 0.21/0.41      (^[X: $i] : refl((big_s(X) | (~(big_q(X) | big_r(X)))) <=> (big_s(X) | (~(big_q(X) | big_r(X)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(5,plain,
% 0.21/0.41      (![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X)))) <=> ![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[4])).
% 0.21/0.41  tff(6,plain,
% 0.21/0.41      (![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X)))) <=> ![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(7,plain,
% 0.21/0.41      (^[X: $i] : rewrite(((big_q(X) | big_r(X)) => big_s(X)) <=> (big_s(X) | (~(big_q(X) | big_r(X)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(8,plain,
% 0.21/0.41      (![X: $i] : ((big_q(X) | big_r(X)) => big_s(X)) <=> ![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[7])).
% 0.21/0.41  tff(9,axiom,(![X: $i] : ((big_q(X) | big_r(X)) => big_s(X))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','pel24_4')).
% 0.21/0.41  tff(10,plain,
% 0.21/0.41      (![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[9, 8])).
% 0.21/0.41  tff(11,plain,
% 0.21/0.41      (![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[10, 6])).
% 0.21/0.41  tff(12,plain,(
% 0.21/0.41      ![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))),
% 0.21/0.41      inference(skolemize,[status(sab)],[11])).
% 0.21/0.41  tff(13,plain,
% 0.21/0.41      (![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[12, 5])).
% 0.21/0.41  tff(14,plain,
% 0.21/0.41      (((~![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))) | (big_s(Y!1) | (~(big_q(Y!1) | big_r(Y!1))))) <=> ((~![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))) | big_s(Y!1) | (~(big_q(Y!1) | big_r(Y!1))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(15,plain,
% 0.21/0.41      ((~![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))) | (big_s(Y!1) | (~(big_q(Y!1) | big_r(Y!1))))),
% 0.21/0.41      inference(quant_inst,[status(thm)],[])).
% 0.21/0.41  tff(16,plain,
% 0.21/0.41      ((~![X: $i] : (big_s(X) | (~(big_q(X) | big_r(X))))) | big_s(Y!1) | (~(big_q(Y!1) | big_r(Y!1)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[15, 14])).
% 0.21/0.41  tff(17,plain,
% 0.21/0.41      (big_s(Y!1)),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[16, 13, 3])).
% 0.21/0.41  tff(18,plain,
% 0.21/0.41      (^[X: $i] : refl(((~big_s(X)) | (~big_q(X))) <=> ((~big_s(X)) | (~big_q(X))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(19,plain,
% 0.21/0.41      (![X: $i] : ((~big_s(X)) | (~big_q(X))) <=> ![X: $i] : ((~big_s(X)) | (~big_q(X)))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[18])).
% 0.21/0.41  tff(20,plain,
% 0.21/0.41      (^[X: $i] : trans(monotonicity(rewrite((big_s(X) & big_q(X)) <=> (~((~big_s(X)) | (~big_q(X))))), ((~(big_s(X) & big_q(X))) <=> (~(~((~big_s(X)) | (~big_q(X))))))), rewrite((~(~((~big_s(X)) | (~big_q(X))))) <=> ((~big_s(X)) | (~big_q(X)))), ((~(big_s(X) & big_q(X))) <=> ((~big_s(X)) | (~big_q(X)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(21,plain,
% 0.21/0.41      (![X: $i] : (~(big_s(X) & big_q(X))) <=> ![X: $i] : ((~big_s(X)) | (~big_q(X)))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[20])).
% 0.21/0.41  tff(22,plain,
% 0.21/0.41      ((~?[X: $i] : (big_s(X) & big_q(X))) <=> (~?[X: $i] : (big_s(X) & big_q(X)))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(23,axiom,(~?[X: $i] : (big_s(X) & big_q(X))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','pel24_1')).
% 0.21/0.41  tff(24,plain,
% 0.21/0.41      (~?[X: $i] : (big_s(X) & big_q(X))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[23, 22])).
% 0.21/0.41  tff(25,plain,
% 0.21/0.41      (~?[X: $i] : (big_s(X) & big_q(X))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[24, 22])).
% 0.21/0.41  tff(26,plain,
% 0.21/0.41      (~?[X: $i] : (big_s(X) & big_q(X))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[25, 22])).
% 0.21/0.41  tff(27,plain,
% 0.21/0.41      (~?[X: $i] : (big_s(X) & big_q(X))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[26, 22])).
% 0.21/0.41  tff(28,plain,
% 0.21/0.41      (~?[X: $i] : (big_s(X) & big_q(X))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[27, 22])).
% 0.21/0.41  tff(29,plain,
% 0.21/0.41      (~?[X: $i] : (big_s(X) & big_q(X))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[28, 22])).
% 0.21/0.41  tff(30,plain,
% 0.21/0.41      (~?[X: $i] : (big_s(X) & big_q(X))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[29, 22])).
% 0.21/0.41  tff(31,plain,
% 0.21/0.41      (^[X: $i] : refl($oeq((~(big_s(X) & big_q(X))), (~(big_s(X) & big_q(X)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(32,plain,(
% 0.21/0.41      ![X: $i] : (~(big_s(X) & big_q(X)))),
% 0.21/0.41      inference(nnf-neg,[status(sab)],[30, 31])).
% 0.21/0.41  tff(33,plain,
% 0.21/0.41      (![X: $i] : ((~big_s(X)) | (~big_q(X)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[32, 21])).
% 0.21/0.41  tff(34,plain,
% 0.21/0.41      (![X: $i] : ((~big_s(X)) | (~big_q(X)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[33, 19])).
% 0.21/0.41  tff(35,plain,
% 0.21/0.41      (((~![X: $i] : ((~big_s(X)) | (~big_q(X)))) | ((~big_s(Y!1)) | (~big_q(Y!1)))) <=> ((~![X: $i] : ((~big_s(X)) | (~big_q(X)))) | (~big_s(Y!1)) | (~big_q(Y!1)))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(36,plain,
% 0.21/0.41      ((~![X: $i] : ((~big_s(X)) | (~big_q(X)))) | ((~big_s(Y!1)) | (~big_q(Y!1)))),
% 0.21/0.41      inference(quant_inst,[status(thm)],[])).
% 0.21/0.41  tff(37,plain,
% 0.21/0.41      ((~![X: $i] : ((~big_s(X)) | (~big_q(X)))) | (~big_s(Y!1)) | (~big_q(Y!1))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[36, 35])).
% 0.21/0.41  tff(38,plain,
% 0.21/0.41      ($false),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[37, 34, 1, 17])).
% 0.21/0.41  tff(39,plain,(~big_q(Y!1)), inference(lemma,lemma(discharge,[]))).
% 0.21/0.41  tff(40,plain,
% 0.21/0.41      ((?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y)) <=> (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(41,plain,
% 0.21/0.41      (((~?[X: $i] : big_p(X)) => ?[Y: $i] : big_q(Y)) <=> (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(42,plain,
% 0.21/0.41      ((~?[X: $i] : big_p(X)) <=> (~?[X: $i] : big_p(X))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(43,plain,
% 0.21/0.41      (((~?[X: $i] : big_p(X)) => ?[Y: $i] : big_q(Y)) <=> ((~?[X: $i] : big_p(X)) => ?[Y: $i] : big_q(Y))),
% 0.21/0.41      inference(monotonicity,[status(thm)],[42])).
% 0.21/0.41  tff(44,plain,
% 0.21/0.41      (((~?[X: $i] : big_p(X)) => ?[Y: $i] : big_q(Y)) <=> (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y))),
% 0.21/0.41      inference(transitivity,[status(thm)],[43, 41])).
% 0.21/0.41  tff(45,axiom,((~?[X: $i] : big_p(X)) => ?[Y: $i] : big_q(Y)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','pel24_3')).
% 0.21/0.41  tff(46,plain,
% 0.21/0.41      (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y)),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[45, 44])).
% 0.21/0.41  tff(47,plain,
% 0.21/0.41      (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y)),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[46, 40])).
% 0.21/0.41  tff(48,plain,
% 0.21/0.41      (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y)),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[47, 40])).
% 0.21/0.41  tff(49,plain,
% 0.21/0.41      (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y)),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[48, 40])).
% 0.21/0.41  tff(50,plain,
% 0.21/0.41      (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y)),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[49, 40])).
% 0.21/0.41  tff(51,plain,
% 0.21/0.41      (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y)),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[50, 40])).
% 0.21/0.41  tff(52,plain,
% 0.21/0.41      (?[X: $i] : big_p(X) | ?[Y: $i] : big_q(Y)),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[51, 40])).
% 0.21/0.41  Proof display could not be completed: monotonicity rule is not handled
%------------------------------------------------------------------------------