↑ Up

Z3---4.15.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN950+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% 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 : Sat Jun 21 05:41:03 AM UTC 2025

% Result   : Theorem 0.20s 0.37s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SYN950+1 : TPTP v9.0.0. Released v3.1.0.
% 0.04/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n001.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   : Fri Jun 20 13:05:50 EDT 2025
% 0.12/0.33  % CPUTime    : 
% 0.20/0.37  % SZS status Theorem
% 0.20/0.37  % SZS output start Proof
% 0.20/0.37  tff(q_type, type, (
% 0.20/0.37     q: $i > $o)).
% 0.20/0.37  tff(tptp_fun_A_1_type, type, (
% 0.20/0.37     tptp_fun_A_1: $i)).
% 0.20/0.37  tff(p_type, type, (
% 0.20/0.37     p: $i > $o)).
% 0.20/0.37  tff(tptp_fun_B_0_type, type, (
% 0.20/0.37     tptp_fun_B_0: $i)).
% 0.20/0.37  tff(1,assumption,(~p(B!0)), introduced(assumption)).
% 0.20/0.37  tff(2,plain,
% 0.20/0.37      (^[Y: $i] : refl((p(Y) | (~q(Y))) <=> (p(Y) | (~q(Y))))),
% 0.20/0.37      inference(bind,[status(th)],[])).
% 0.20/0.37  tff(3,plain,
% 0.20/0.37      (![Y: $i] : (p(Y) | (~q(Y))) <=> ![Y: $i] : (p(Y) | (~q(Y)))),
% 0.20/0.37      inference(quant_intro,[status(thm)],[2])).
% 0.20/0.37  tff(4,plain,
% 0.20/0.37      ((![Y: $i] : (p(Y) | (~q(Y))) & ![X: $i] : (~((p(A!1) | (~p(X))) & (p(B!0) | (~q(X)))))) <=> (![Y: $i] : (p(Y) | (~q(Y))) & ![X: $i] : (~((p(A!1) | (~p(X))) & (p(B!0) | (~q(X))))))),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(5,plain,
% 0.20/0.37      ((~![A: $i, B: $i] : ((~![Y: $i] : (p(Y) | (~q(Y)))) | ?[X: $i] : ((p(A) | (~p(X))) & (p(B) | (~q(X)))))) <=> (~![A: $i, B: $i] : ((~![Y: $i] : (p(Y) | (~q(Y)))) | ?[X: $i] : ((p(A) | (~p(X))) & (p(B) | (~q(X))))))),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(6,plain,
% 0.20/0.37      ((~![A: $i, B: $i] : (![Y: $i] : (q(Y) => p(Y)) => ?[X: $i] : ((p(X) => p(A)) & (q(X) => p(B))))) <=> (~![A: $i, B: $i] : ((~![Y: $i] : (p(Y) | (~q(Y)))) | ?[X: $i] : ((p(A) | (~p(X))) & (p(B) | (~q(X))))))),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(7,axiom,(~![A: $i, B: $i] : (![Y: $i] : (q(Y) => p(Y)) => ?[X: $i] : ((p(X) => p(A)) & (q(X) => p(B))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.20/0.37  tff(8,plain,
% 0.20/0.37      (~![A: $i, B: $i] : ((~![Y: $i] : (p(Y) | (~q(Y)))) | ?[X: $i] : ((p(A) | (~p(X))) & (p(B) | (~q(X)))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[7, 6])).
% 0.20/0.37  tff(9,plain,
% 0.20/0.37      (~![A: $i, B: $i] : ((~![Y: $i] : (p(Y) | (~q(Y)))) | ?[X: $i] : ((p(A) | (~p(X))) & (p(B) | (~q(X)))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[8, 5])).
% 0.20/0.37  tff(10,plain,
% 0.20/0.37      (~![A: $i, B: $i] : ((~![Y: $i] : (p(Y) | (~q(Y)))) | ?[X: $i] : ((p(A) | (~p(X))) & (p(B) | (~q(X)))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[9, 5])).
% 0.20/0.37  tff(11,plain,
% 0.20/0.37      (~![A: $i, B: $i] : ((~![Y: $i] : (p(Y) | (~q(Y)))) | ?[X: $i] : ((p(A) | (~p(X))) & (p(B) | (~q(X)))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[10, 5])).
% 0.20/0.37  tff(12,plain,
% 0.20/0.37      (![Y: $i] : (p(Y) | (~q(Y))) & ![X: $i] : (~((p(A!1) | (~p(X))) & (p(B!0) | (~q(X)))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[11, 4])).
% 0.20/0.37  tff(13,plain,
% 0.20/0.37      (![Y: $i] : (p(Y) | (~q(Y)))),
% 0.20/0.37      inference(and_elim,[status(thm)],[12])).
% 0.20/0.37  tff(14,plain,
% 0.20/0.37      (![Y: $i] : (p(Y) | (~q(Y)))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[13, 3])).
% 0.20/0.37  tff(15,plain,
% 0.20/0.37      (((~![Y: $i] : (p(Y) | (~q(Y)))) | (p(B!0) | (~q(B!0)))) <=> ((~![Y: $i] : (p(Y) | (~q(Y)))) | p(B!0) | (~q(B!0)))),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(16,plain,
% 0.20/0.37      ((~![Y: $i] : (p(Y) | (~q(Y)))) | (p(B!0) | (~q(B!0)))),
% 0.20/0.37      inference(quant_inst,[status(thm)],[])).
% 0.20/0.37  tff(17,plain,
% 0.20/0.37      ((~![Y: $i] : (p(Y) | (~q(Y)))) | p(B!0) | (~q(B!0))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[16, 15])).
% 0.20/0.37  tff(18,plain,
% 0.20/0.37      (~q(B!0)),
% 0.20/0.37      inference(unit_resolution,[status(thm)],[17, 14, 1])).
% 0.20/0.37  tff(19,plain,
% 0.20/0.37      ((p(B!0) | (~q(B!0))) | q(B!0)),
% 0.20/0.37      inference(tautology,[status(thm)],[])).
% 0.20/0.37  tff(20,plain,
% 0.20/0.37      (p(B!0) | (~q(B!0))),
% 0.20/0.37      inference(unit_resolution,[status(thm)],[19, 18])).
% 0.20/0.37  tff(21,plain,
% 0.20/0.37      ((p(A!1) | (~p(B!0))) | p(B!0)),
% 0.20/0.37      inference(tautology,[status(thm)],[])).
% 0.20/0.37  tff(22,plain,
% 0.20/0.37      (p(A!1) | (~p(B!0))),
% 0.20/0.37      inference(unit_resolution,[status(thm)],[21, 1])).
% 0.20/0.37  tff(23,plain,
% 0.20/0.37      (^[X: $i] : refl(((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X))))) <=> ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X))))))),
% 0.20/0.37      inference(bind,[status(th)],[])).
% 0.20/0.37  tff(24,plain,
% 0.20/0.37      (![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X))))) <=> ![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))),
% 0.20/0.37      inference(quant_intro,[status(thm)],[23])).
% 0.20/0.37  tff(25,plain,
% 0.20/0.37      (^[X: $i] : trans(monotonicity(rewrite(((p(A!1) | (~p(X))) & (p(B!0) | (~q(X)))) <=> (~((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X))))))), ((~((p(A!1) | (~p(X))) & (p(B!0) | (~q(X))))) <=> (~(~((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X))))))))), rewrite((~(~((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X))))))) <=> ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))), ((~((p(A!1) | (~p(X))) & (p(B!0) | (~q(X))))) <=> ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))))),
% 0.20/0.37      inference(bind,[status(th)],[])).
% 0.20/0.37  tff(26,plain,
% 0.20/0.37      (![X: $i] : (~((p(A!1) | (~p(X))) & (p(B!0) | (~q(X))))) <=> ![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))),
% 0.20/0.37      inference(quant_intro,[status(thm)],[25])).
% 0.20/0.37  tff(27,plain,
% 0.20/0.37      (![X: $i] : (~((p(A!1) | (~p(X))) & (p(B!0) | (~q(X)))))),
% 0.20/0.37      inference(and_elim,[status(thm)],[12])).
% 0.20/0.37  tff(28,plain,
% 0.20/0.37      (![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[27, 26])).
% 0.20/0.37  tff(29,plain,
% 0.20/0.37      (![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[28, 24])).
% 0.20/0.37  tff(30,plain,
% 0.20/0.37      (((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | ((~(p(A!1) | (~p(B!0)))) | (~(p(B!0) | (~q(B!0)))))) <=> ((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | (~(p(A!1) | (~p(B!0)))) | (~(p(B!0) | (~q(B!0)))))),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(31,plain,
% 0.20/0.37      ((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | ((~(p(A!1) | (~p(B!0)))) | (~(p(B!0) | (~q(B!0)))))),
% 0.20/0.37      inference(quant_inst,[status(thm)],[])).
% 0.20/0.37  tff(32,plain,
% 0.20/0.37      ((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | (~(p(A!1) | (~p(B!0)))) | (~(p(B!0) | (~q(B!0))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[31, 30])).
% 0.20/0.37  tff(33,plain,
% 0.20/0.37      ($false),
% 0.20/0.37      inference(unit_resolution,[status(thm)],[32, 29, 22, 20])).
% 0.20/0.37  tff(34,plain,(p(B!0)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.37  tff(35,plain,
% 0.20/0.37      ((p(B!0) | (~q(A!1))) | (~p(B!0))),
% 0.20/0.37      inference(tautology,[status(thm)],[])).
% 0.20/0.37  tff(36,plain,
% 0.20/0.37      (p(B!0) | (~q(A!1))),
% 0.20/0.37      inference(unit_resolution,[status(thm)],[35, 34])).
% 0.20/0.37  tff(37,plain,
% 0.20/0.37      (((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | (~(p(B!0) | (~q(A!1))))) <=> ((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | (~(p(B!0) | (~q(A!1)))))),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(38,plain,
% 0.20/0.37      (($false | (~(p(B!0) | (~q(A!1))))) <=> (~(p(B!0) | (~q(A!1))))),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(39,plain,
% 0.20/0.37      ((~$true) <=> $false),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(40,plain,
% 0.20/0.37      ((p(A!1) | (~p(A!1))) <=> $true),
% 0.20/0.37      inference(rewrite,[status(thm)],[])).
% 0.20/0.37  tff(41,plain,
% 0.20/0.37      ((~(p(A!1) | (~p(A!1)))) <=> (~$true)),
% 0.20/0.37      inference(monotonicity,[status(thm)],[40])).
% 0.20/0.37  tff(42,plain,
% 0.20/0.37      ((~(p(A!1) | (~p(A!1)))) <=> $false),
% 0.20/0.37      inference(transitivity,[status(thm)],[41, 39])).
% 0.20/0.37  tff(43,plain,
% 0.20/0.37      (((~(p(A!1) | (~p(A!1)))) | (~(p(B!0) | (~q(A!1))))) <=> ($false | (~(p(B!0) | (~q(A!1)))))),
% 0.20/0.37      inference(monotonicity,[status(thm)],[42])).
% 0.20/0.37  tff(44,plain,
% 0.20/0.37      (((~(p(A!1) | (~p(A!1)))) | (~(p(B!0) | (~q(A!1))))) <=> (~(p(B!0) | (~q(A!1))))),
% 0.20/0.37      inference(transitivity,[status(thm)],[43, 38])).
% 0.20/0.37  tff(45,plain,
% 0.20/0.37      (((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | ((~(p(A!1) | (~p(A!1)))) | (~(p(B!0) | (~q(A!1)))))) <=> ((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | (~(p(B!0) | (~q(A!1)))))),
% 0.20/0.37      inference(monotonicity,[status(thm)],[44])).
% 0.20/0.37  tff(46,plain,
% 0.20/0.37      (((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | ((~(p(A!1) | (~p(A!1)))) | (~(p(B!0) | (~q(A!1)))))) <=> ((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | (~(p(B!0) | (~q(A!1)))))),
% 0.20/0.37      inference(transitivity,[status(thm)],[45, 37])).
% 0.20/0.37  tff(47,plain,
% 0.20/0.37      ((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | ((~(p(A!1) | (~p(A!1)))) | (~(p(B!0) | (~q(A!1)))))),
% 0.20/0.37      inference(quant_inst,[status(thm)],[])).
% 0.20/0.37  tff(48,plain,
% 0.20/0.37      ((~![X: $i] : ((~(p(A!1) | (~p(X)))) | (~(p(B!0) | (~q(X)))))) | (~(p(B!0) | (~q(A!1))))),
% 0.20/0.37      inference(modus_ponens,[status(thm)],[47, 46])).
% 0.20/0.37  tff(49,plain,
% 0.20/0.37      ($false),
% 0.20/0.37      inference(unit_resolution,[status(thm)],[48, 29, 36])).
% 0.20/0.37  % SZS output end Proof
% 0.20/0.37  % E exiting
%------------------------------------------------------------------------------