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

View Problem - Process Solution

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

% Computer : n012.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 : Fri Sep 30 00:01:29 EDT 2022

% Result   : Theorem 0.19s 0.38s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Mon Sep  5 09:47:17 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.19/0.38  % SZS status Theorem
% 0.19/0.38  % SZS output start Proof
% 0.19/0.38  tff(p_type, type, (
% 0.19/0.38     p: ( $i * $i ) > $o)).
% 0.19/0.38  tff(tptp_fun_B_0_type, type, (
% 0.19/0.38     tptp_fun_B_0: $i)).
% 0.19/0.38  tff(f_type, type, (
% 0.19/0.38     f: $i > $i)).
% 0.19/0.38  tff(q_type, type, (
% 0.19/0.38     q: ( $i * $i ) > $o)).
% 0.19/0.38  tff(r_type, type, (
% 0.19/0.38     r: $i > $o)).
% 0.19/0.38  tff(1,assumption,(p(f(B!0), B!0)), introduced(assumption)).
% 0.19/0.38  tff(2,plain,
% 0.19/0.38      (^[X: $i, Y: $i] : refl(((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y)))) <=> ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y)))))),
% 0.19/0.38      inference(bind,[status(th)],[])).
% 0.19/0.38  tff(3,plain,
% 0.19/0.38      (![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y)))) <=> ![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))),
% 0.19/0.38      inference(quant_intro,[status(thm)],[2])).
% 0.19/0.38  tff(4,plain,
% 0.19/0.38      (^[X: $i, Y: $i] : trans(monotonicity(rewrite((p(X, Y) & ((~q(f(B!0), B!0)) | q(X, Y))) <=> (~((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y)))))), ((~(p(X, Y) & ((~q(f(B!0), B!0)) | q(X, Y)))) <=> (~(~((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y)))))))), rewrite((~(~((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y)))))) <=> ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))), ((~(p(X, Y) & ((~q(f(B!0), B!0)) | q(X, Y)))) <=> ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))))),
% 0.19/0.38      inference(bind,[status(th)],[])).
% 0.19/0.38  tff(5,plain,
% 0.19/0.38      (![X: $i, Y: $i] : (~(p(X, Y) & ((~q(f(B!0), B!0)) | q(X, Y)))) <=> ![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))),
% 0.19/0.38      inference(quant_intro,[status(thm)],[4])).
% 0.19/0.38  tff(6,plain,
% 0.19/0.38      ((![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y)) & ![X: $i, Y: $i] : (~(p(X, Y) & ((~q(f(B!0), B!0)) | q(X, Y))))) <=> (![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y)) & ![X: $i, Y: $i] : (~(p(X, Y) & ((~q(f(B!0), B!0)) | q(X, Y)))))),
% 0.19/0.38      inference(rewrite,[status(thm)],[])).
% 0.19/0.38  tff(7,plain,
% 0.19/0.38      ((~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y))))) <=> (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y)))))),
% 0.19/0.38      inference(rewrite,[status(thm)],[])).
% 0.19/0.38  tff(8,plain,
% 0.19/0.38      ((~![B: $i] : (![Y: $i] : ((r(B) => r(Y)) => p(f(Y), Y)) => ?[X: $i, Y: $i] : (p(X, Y) & (q(f(B), B) => q(X, Y))))) <=> (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y)))))),
% 0.19/0.38      inference(rewrite,[status(thm)],[])).
% 0.19/0.38  tff(9,axiom,(~![B: $i] : (![Y: $i] : ((r(B) => r(Y)) => p(f(Y), Y)) => ?[X: $i, Y: $i] : (p(X, Y) & (q(f(B), B) => q(X, Y))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.19/0.38  tff(10,plain,
% 0.19/0.38      (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y))))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[9, 8])).
% 0.19/0.38  tff(11,plain,
% 0.19/0.38      (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y))))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[10, 7])).
% 0.19/0.38  tff(12,plain,
% 0.19/0.38      (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y))))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[11, 7])).
% 0.19/0.38  tff(13,plain,
% 0.19/0.38      (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y))))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[12, 7])).
% 0.19/0.38  tff(14,plain,
% 0.19/0.38      (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y))))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[13, 7])).
% 0.19/0.38  tff(15,plain,
% 0.19/0.38      (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y))))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[14, 7])).
% 0.19/0.38  tff(16,plain,
% 0.19/0.38      (~![B: $i] : ((~![Y: $i] : ((~(r(Y) | (~r(B)))) | p(f(Y), Y))) | ?[X: $i, Y: $i] : (p(X, Y) & ((~q(f(B), B)) | q(X, Y))))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[15, 7])).
% 0.19/0.38  tff(17,plain,
% 0.19/0.38      (![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y)) & ![X: $i, Y: $i] : (~(p(X, Y) & ((~q(f(B!0), B!0)) | q(X, Y))))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[16, 6])).
% 0.19/0.38  tff(18,plain,
% 0.19/0.39      (![X: $i, Y: $i] : (~(p(X, Y) & ((~q(f(B!0), B!0)) | q(X, Y))))),
% 0.19/0.39      inference(and_elim,[status(thm)],[17])).
% 0.19/0.39  tff(19,plain,
% 0.19/0.39      (![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))),
% 0.19/0.39      inference(modus_ponens,[status(thm)],[18, 5])).
% 0.19/0.39  tff(20,plain,
% 0.19/0.39      (![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))),
% 0.19/0.39      inference(modus_ponens,[status(thm)],[19, 3])).
% 0.19/0.39  tff(21,plain,
% 0.19/0.39      (((~![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))) | (~p(f(B!0), B!0))) <=> ((~![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))) | (~p(f(B!0), B!0)))),
% 0.19/0.39      inference(rewrite,[status(thm)],[])).
% 0.19/0.39  tff(22,plain,
% 0.19/0.39      (((~p(f(B!0), B!0)) | $false) <=> (~p(f(B!0), B!0))),
% 0.19/0.39      inference(rewrite,[status(thm)],[])).
% 0.19/0.39  tff(23,plain,
% 0.19/0.39      ((~$true) <=> $false),
% 0.19/0.39      inference(rewrite,[status(thm)],[])).
% 0.19/0.39  tff(24,plain,
% 0.19/0.39      (((~q(f(B!0), B!0)) | q(f(B!0), B!0)) <=> $true),
% 0.19/0.39      inference(rewrite,[status(thm)],[])).
% 0.19/0.39  tff(25,plain,
% 0.19/0.39      ((~((~q(f(B!0), B!0)) | q(f(B!0), B!0))) <=> (~$true)),
% 0.19/0.39      inference(monotonicity,[status(thm)],[24])).
% 0.19/0.39  tff(26,plain,
% 0.19/0.39      ((~((~q(f(B!0), B!0)) | q(f(B!0), B!0))) <=> $false),
% 0.19/0.39      inference(transitivity,[status(thm)],[25, 23])).
% 0.19/0.39  tff(27,plain,
% 0.19/0.39      (((~p(f(B!0), B!0)) | (~((~q(f(B!0), B!0)) | q(f(B!0), B!0)))) <=> ((~p(f(B!0), B!0)) | $false)),
% 0.19/0.39      inference(monotonicity,[status(thm)],[26])).
% 0.19/0.39  tff(28,plain,
% 0.19/0.39      (((~p(f(B!0), B!0)) | (~((~q(f(B!0), B!0)) | q(f(B!0), B!0)))) <=> (~p(f(B!0), B!0))),
% 0.19/0.39      inference(transitivity,[status(thm)],[27, 22])).
% 0.19/0.39  tff(29,plain,
% 0.19/0.39      (((~![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))) | ((~p(f(B!0), B!0)) | (~((~q(f(B!0), B!0)) | q(f(B!0), B!0))))) <=> ((~![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))) | (~p(f(B!0), B!0)))),
% 0.19/0.39      inference(monotonicity,[status(thm)],[28])).
% 0.19/0.39  tff(30,plain,
% 0.19/0.39      (((~![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))) | ((~p(f(B!0), B!0)) | (~((~q(f(B!0), B!0)) | q(f(B!0), B!0))))) <=> ((~![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))) | (~p(f(B!0), B!0)))),
% 0.19/0.39      inference(transitivity,[status(thm)],[29, 21])).
% 0.19/0.39  tff(31,plain,
% 0.19/0.39      ((~![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))) | ((~p(f(B!0), B!0)) | (~((~q(f(B!0), B!0)) | q(f(B!0), B!0))))),
% 0.19/0.39      inference(quant_inst,[status(thm)],[])).
% 0.19/0.39  tff(32,plain,
% 0.19/0.39      ((~![X: $i, Y: $i] : ((~p(X, Y)) | (~((~q(f(B!0), B!0)) | q(X, Y))))) | (~p(f(B!0), B!0))),
% 0.19/0.39      inference(modus_ponens,[status(thm)],[31, 30])).
% 0.19/0.39  tff(33,plain,
% 0.19/0.39      ($false),
% 0.19/0.39      inference(unit_resolution,[status(thm)],[32, 20, 1])).
% 0.19/0.39  tff(34,plain,(~p(f(B!0), B!0)), inference(lemma,lemma(discharge,[]))).
% 0.19/0.39  tff(35,plain,
% 0.19/0.39      (^[Y: $i] : refl(((~(r(Y) | (~r(B!0)))) | p(f(Y), Y)) <=> ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y)))),
% 0.19/0.39      inference(bind,[status(th)],[])).
% 0.19/0.39  tff(36,plain,
% 0.19/0.39      (![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y)) <=> ![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))),
% 0.19/0.39      inference(quant_intro,[status(thm)],[35])).
% 0.19/0.39  tff(37,plain,
% 0.19/0.39      (![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))),
% 0.19/0.39      inference(and_elim,[status(thm)],[17])).
% 0.19/0.39  tff(38,plain,
% 0.19/0.39      (![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))),
% 0.19/0.39      inference(modus_ponens,[status(thm)],[37, 36])).
% 0.19/0.39  tff(39,plain,
% 0.19/0.39      (((~![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))) | p(f(B!0), B!0)) <=> ((~![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))) | p(f(B!0), B!0))),
% 0.19/0.39      inference(rewrite,[status(thm)],[])).
% 0.19/0.39  tff(40,plain,
% 0.19/0.39      (($false | p(f(B!0), B!0)) <=> p(f(B!0), B!0)),
% 0.19/0.39      inference(rewrite,[status(thm)],[])).
% 0.19/0.39  tff(41,plain,
% 0.19/0.39      ((r(B!0) | (~r(B!0))) <=> $true),
% 0.19/0.39      inference(rewrite,[status(thm)],[])).
% 0.19/0.39  tff(42,plain,
% 0.19/0.39      ((~(r(B!0) | (~r(B!0)))) <=> (~$true)),
% 0.19/0.39      inference(monotonicity,[status(thm)],[41])).
% 0.19/0.39  tff(43,plain,
% 0.19/0.39      ((~(r(B!0) | (~r(B!0)))) <=> $false),
% 0.19/0.39      inference(transitivity,[status(thm)],[42, 23])).
% 0.19/0.39  tff(44,plain,
% 0.19/0.39      (((~(r(B!0) | (~r(B!0)))) | p(f(B!0), B!0)) <=> ($false | p(f(B!0), B!0))),
% 0.19/0.39      inference(monotonicity,[status(thm)],[43])).
% 0.19/0.39  tff(45,plain,
% 0.19/0.39      (((~(r(B!0) | (~r(B!0)))) | p(f(B!0), B!0)) <=> p(f(B!0), B!0)),
% 0.19/0.39      inference(transitivity,[status(thm)],[44, 40])).
% 0.19/0.39  tff(46,plain,
% 0.19/0.39      (((~![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))) | ((~(r(B!0) | (~r(B!0)))) | p(f(B!0), B!0))) <=> ((~![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))) | p(f(B!0), B!0))),
% 0.19/0.39      inference(monotonicity,[status(thm)],[45])).
% 0.19/0.39  tff(47,plain,
% 0.19/0.39      (((~![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))) | ((~(r(B!0) | (~r(B!0)))) | p(f(B!0), B!0))) <=> ((~![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))) | p(f(B!0), B!0))),
% 0.19/0.39      inference(transitivity,[status(thm)],[46, 39])).
% 0.19/0.39  tff(48,plain,
% 0.19/0.39      ((~![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))) | ((~(r(B!0) | (~r(B!0)))) | p(f(B!0), B!0))),
% 0.19/0.39      inference(quant_inst,[status(thm)],[])).
% 0.19/0.39  tff(49,plain,
% 0.19/0.39      ((~![Y: $i] : ((~(r(Y) | (~r(B!0)))) | p(f(Y), Y))) | p(f(B!0), B!0)),
% 0.19/0.39      inference(modus_ponens,[status(thm)],[48, 47])).
% 0.19/0.39  tff(50,plain,
% 0.19/0.39      ($false),
% 0.19/0.39      inference(unit_resolution,[status(thm)],[49, 38, 34])).
% 0.19/0.39  % SZS output end Proof
%------------------------------------------------------------------------------