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

View Problem - Process Solution

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

% Computer : n015.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:25 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.07/0.12  % Problem  : SYN963+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n015.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 09:54:42 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 > $o)).
% 0.19/0.38  tff(tptp_fun_Y_1_type, type, (
% 0.19/0.38     tptp_fun_Y_1: $i)).
% 0.19/0.38  tff(tptp_fun_X_0_type, type, (
% 0.19/0.38     tptp_fun_X_0: $i)).
% 0.19/0.38  tff(1,assumption,(![X: $i] : (~p(X))), introduced(assumption)).
% 0.19/0.38  tff(2,assumption,(p(X!0)), introduced(assumption)).
% 0.19/0.38  tff(3,plain,
% 0.19/0.38      ((~![X: $i] : (~p(X))) | (~p(X!0))),
% 0.19/0.38      inference(quant_inst,[status(thm)],[])).
% 0.19/0.38  tff(4,plain,
% 0.19/0.38      ($false),
% 0.19/0.38      inference(unit_resolution,[status(thm)],[3, 2, 1])).
% 0.19/0.38  tff(5,plain,((~p(X!0)) | (~![X: $i] : (~p(X)))), inference(lemma,lemma(discharge,[]))).
% 0.19/0.38  tff(6,plain,
% 0.19/0.38      (~p(X!0)),
% 0.19/0.38      inference(unit_resolution,[status(thm)],[5, 1])).
% 0.19/0.38  tff(7,plain,
% 0.19/0.38      ((![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y))) <=> (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y)))),
% 0.19/0.38      inference(rewrite,[status(thm)],[])).
% 0.19/0.38  tff(8,plain,
% 0.19/0.38      (((p(X!0) | p(Y!1)) & (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y)))) <=> ((p(X!0) | p(Y!1)) & (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y))))),
% 0.19/0.38      inference(monotonicity,[status(thm)],[7])).
% 0.19/0.38  tff(9,plain,
% 0.19/0.38      (((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y)) <=> ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y))),
% 0.19/0.38      inference(rewrite,[status(thm)],[])).
% 0.19/0.38  tff(10,plain,
% 0.19/0.38      ((~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))) <=> ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y))),
% 0.19/0.38      inference(rewrite,[status(thm)],[])).
% 0.19/0.38  tff(11,plain,
% 0.19/0.38      ((?[X: $i] : p(X) <=> ?[Y: $i] : p(Y)) <=> (?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))),
% 0.19/0.38      inference(rewrite,[status(thm)],[])).
% 0.19/0.38  tff(12,plain,
% 0.19/0.38      ((~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))) <=> (~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y)))),
% 0.19/0.38      inference(monotonicity,[status(thm)],[11])).
% 0.19/0.38  tff(13,plain,
% 0.19/0.38      ((~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))) <=> ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y))),
% 0.19/0.38      inference(transitivity,[status(thm)],[12, 10])).
% 0.19/0.38  tff(14,axiom,(~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_this')).
% 0.19/0.38  tff(15,plain,
% 0.19/0.38      ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y)),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[14, 13])).
% 0.19/0.38  tff(16,plain,
% 0.19/0.38      ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y)),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[15, 9])).
% 0.19/0.38  tff(17,plain,
% 0.19/0.38      ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y)),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[16, 9])).
% 0.19/0.38  tff(18,plain,
% 0.19/0.38      ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y)),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[17, 9])).
% 0.19/0.38  tff(19,plain,
% 0.19/0.38      ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y)),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[18, 9])).
% 0.19/0.38  tff(20,plain,
% 0.19/0.38      ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y)),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[19, 9])).
% 0.19/0.38  tff(21,plain,
% 0.19/0.38      ((~?[X: $i] : p(X)) <=> ?[Y: $i] : p(Y)),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[20, 9])).
% 0.19/0.38  tff(22,plain,(
% 0.19/0.38      (p(X!0) | p(Y!1)) & (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y)))),
% 0.19/0.38      inference(skolemize,[status(sab)],[21])).
% 0.19/0.38  tff(23,plain,
% 0.19/0.38      ((p(X!0) | p(Y!1)) & (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y)))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[22, 8])).
% 0.19/0.38  tff(24,plain,
% 0.19/0.38      (p(X!0) | p(Y!1)),
% 0.19/0.38      inference(and_elim,[status(thm)],[23])).
% 0.19/0.38  tff(25,plain,
% 0.19/0.38      (p(Y!1)),
% 0.19/0.38      inference(unit_resolution,[status(thm)],[24, 6])).
% 0.19/0.38  tff(26,plain,
% 0.19/0.38      ((~![X: $i] : (~p(X))) | (~p(Y!1))),
% 0.19/0.38      inference(quant_inst,[status(thm)],[])).
% 0.19/0.38  tff(27,plain,
% 0.19/0.38      ($false),
% 0.19/0.38      inference(unit_resolution,[status(thm)],[26, 25, 1])).
% 0.19/0.38  tff(28,plain,(~![X: $i] : (~p(X))), inference(lemma,lemma(discharge,[]))).
% 0.19/0.38  tff(29,plain,
% 0.19/0.38      ((![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y))) <=> (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y)))),
% 0.19/0.38      inference(rewrite,[status(thm)],[])).
% 0.19/0.38  tff(30,plain,
% 0.19/0.38      (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y))),
% 0.19/0.38      inference(and_elim,[status(thm)],[23])).
% 0.19/0.38  tff(31,plain,
% 0.19/0.38      (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y))),
% 0.19/0.38      inference(modus_ponens,[status(thm)],[30, 29])).
% 0.19/0.38  tff(32,plain,
% 0.19/0.38      (![Y: $i] : (~p(Y))),
% 0.19/0.38      inference(unit_resolution,[status(thm)],[31, 28])).
% 0.19/0.38  tff(33,assumption,(p(Y!1)), introduced(assumption)).
% 0.19/0.38  tff(34,plain,
% 0.19/0.38      ((~![Y: $i] : (~p(Y))) | (~p(Y!1))),
% 0.19/0.38      inference(quant_inst,[status(thm)],[])).
% 0.19/0.38  tff(35,plain,
% 0.19/0.38      ($false),
% 0.19/0.38      inference(unit_resolution,[status(thm)],[34, 33, 32])).
% 0.19/0.38  tff(36,plain,(~p(Y!1)), inference(lemma,lemma(discharge,[]))).
% 0.19/0.38  tff(37,plain,
% 0.19/0.38      (p(X!0)),
% 0.19/0.38      inference(unit_resolution,[status(thm)],[24, 36])).
% 0.19/0.38  tff(38,plain,
% 0.19/0.38      ((~![Y: $i] : (~p(Y))) | (~p(X!0))),
% 0.19/0.38      inference(quant_inst,[status(thm)],[])).
% 0.19/0.38  tff(39,plain,
% 0.19/0.38      ($false),
% 0.19/0.38      inference(unit_resolution,[status(thm)],[38, 37, 32])).
% 0.19/0.38  % SZS output end Proof
%------------------------------------------------------------------------------