TSTP Solution File: SYN936+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN936+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n014.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:19 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN936+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.34 % Computer : n014.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:36:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 0.20/0.39 % SZS status Theorem
% 0.20/0.39 % SZS output start Proof
% 0.20/0.39 tff(p_type, type, (
% 0.20/0.39 p: $i > $o)).
% 0.20/0.39 tff(tptp_fun_X_1_type, type, (
% 0.20/0.39 tptp_fun_X_1: $i)).
% 0.20/0.39 tff(k!0_type, type, (
% 0.20/0.39 k!0: $o)).
% 0.20/0.39 tff(tptp_fun_X_2_type, type, (
% 0.20/0.39 tptp_fun_X_2: $i)).
% 0.20/0.39 tff(c_type, type, (
% 0.20/0.39 c: $o)).
% 0.20/0.39 tff(1,assumption,(~(k!0 | p(X!2))), introduced(assumption)).
% 0.20/0.39 tff(2,plain,
% 0.20/0.39 ((k!0 | p(X!2)) | (~p(X!2))),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(3,plain,
% 0.20/0.39 (~p(X!2)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[2, 1])).
% 0.20/0.39 tff(4,plain,
% 0.20/0.39 ((k!0 | p(X!2)) | (~k!0)),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(5,plain,
% 0.20/0.39 (~k!0),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[4, 1])).
% 0.20/0.39 tff(6,assumption,(~p(X!2)), introduced(assumption)).
% 0.20/0.39 tff(7,assumption,(![X: $i] : p(X)), introduced(assumption)).
% 0.20/0.39 tff(8,plain,
% 0.20/0.39 ((~![X: $i] : p(X)) | p(X!2)),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(9,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[8, 7, 6])).
% 0.20/0.39 tff(10,plain,((~![X: $i] : p(X)) | p(X!2)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.39 tff(11,plain,
% 0.20/0.39 (~![X: $i] : p(X)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[10, 3])).
% 0.20/0.39 tff(12,plain,
% 0.20/0.39 ((![X: $i] : p(X) | k!0 | ![X: $i] : (k!0 | p(X))) <=> (k!0 | ![X: $i] : p(X) | ![X: $i] : (k!0 | p(X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(13,plain,
% 0.20/0.39 ((![X: $i] : p(X) | k!0 | ![X: $i] : (k!0 | p(X))) <=> (![X: $i] : p(X) | k!0 | ![X: $i] : (k!0 | p(X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(14,plain,
% 0.20/0.39 (((![X: $i] : (k!0 | p(X)) | (k!0 | ![X: $i] : p(X))) & ((~(k!0 | p(X!1))) | ((~k!0) & (~p(X!2))))) <=> ((![X: $i] : p(X) | k!0 | ![X: $i] : (k!0 | p(X))) & ((~(k!0 | p(X!1))) | ((~k!0) & (~p(X!2)))))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(15,plain,
% 0.20/0.39 ((k!0 | ![X: $i] : p(X)) <=> (k!0 | ![X: $i] : p(X))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(16,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) <=> (~![X: $i] : (k!0 | p(X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(17,plain,
% 0.20/0.39 (((~![X: $i] : (k!0 | p(X))) <=> (k!0 | ![X: $i] : p(X))) <=> ((~![X: $i] : (k!0 | p(X))) <=> (k!0 | ![X: $i] : p(X)))),
% 0.20/0.39 inference(monotonicity,[status(thm)],[16, 15])).
% 0.20/0.39 tff(18,plain,
% 0.20/0.39 (((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X))) <=> ((~![X: $i] : (k!0 | p(X))) <=> (k!0 | ![X: $i] : p(X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(19,plain,
% 0.20/0.39 (((~c) | ![X: $i] : p(X)) <=> ((~c) | ![X: $i] : p(X))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(20,plain,
% 0.20/0.39 ((~![X: $i] : ((~c) | p(X))) <=> (~![X: $i] : ((~c) | p(X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(21,plain,
% 0.20/0.39 (((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X))) <=> ((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X)))),
% 0.20/0.39 inference(monotonicity,[status(thm)],[20, 19])).
% 0.20/0.39 tff(22,plain,
% 0.20/0.39 (((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X))) <=> ((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(23,plain,
% 0.20/0.39 ((~(![X: $i] : ((~c) | p(X)) <=> ((~c) | ![X: $i] : p(X)))) <=> ((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(24,plain,
% 0.20/0.39 ((![X: $i] : (c => p(X)) <=> (c => ![X: $i] : p(X))) <=> (![X: $i] : ((~c) | p(X)) <=> ((~c) | ![X: $i] : p(X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(25,plain,
% 0.20/0.39 ((~(![X: $i] : (c => p(X)) <=> (c => ![X: $i] : p(X)))) <=> (~(![X: $i] : ((~c) | p(X)) <=> ((~c) | ![X: $i] : p(X))))),
% 0.20/0.39 inference(monotonicity,[status(thm)],[24])).
% 0.20/0.39 tff(26,plain,
% 0.20/0.39 ((~(![X: $i] : (c => p(X)) <=> (c => ![X: $i] : p(X)))) <=> ((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X)))),
% 0.20/0.39 inference(transitivity,[status(thm)],[25, 23])).
% 0.20/0.39 tff(27,axiom,(~(![X: $i] : (c => p(X)) <=> (c => ![X: $i] : p(X)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.20/0.39 tff(28,plain,
% 0.20/0.39 ((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[27, 26])).
% 0.20/0.39 tff(29,plain,
% 0.20/0.39 ((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[28, 21])).
% 0.20/0.39 tff(30,plain,
% 0.20/0.39 ((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[29, 22])).
% 0.20/0.39 tff(31,plain,
% 0.20/0.39 ((~![X: $i] : ((~c) | p(X))) <=> ((~c) | ![X: $i] : p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[30, 21])).
% 0.20/0.39 tff(32,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) <=> (k!0 | ![X: $i] : p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[31, 18])).
% 0.20/0.39 tff(33,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) <=> (k!0 | ![X: $i] : p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[32, 17])).
% 0.20/0.39 tff(34,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) <=> (k!0 | ![X: $i] : p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[33, 17])).
% 0.20/0.39 tff(35,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) <=> (k!0 | ![X: $i] : p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[34, 17])).
% 0.20/0.39 tff(36,plain,(
% 0.20/0.39 (![X: $i] : (k!0 | p(X)) | (k!0 | ![X: $i] : p(X))) & ((~(k!0 | p(X!1))) | ((~k!0) & (~p(X!2))))),
% 0.20/0.39 inference(skolemize,[status(sab)],[35])).
% 0.20/0.39 tff(37,plain,
% 0.20/0.39 ((![X: $i] : p(X) | k!0 | ![X: $i] : (k!0 | p(X))) & ((~(k!0 | p(X!1))) | ((~k!0) & (~p(X!2))))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[36, 14])).
% 0.20/0.39 tff(38,plain,
% 0.20/0.39 (![X: $i] : p(X) | k!0 | ![X: $i] : (k!0 | p(X))),
% 0.20/0.39 inference(and_elim,[status(thm)],[37])).
% 0.20/0.39 tff(39,plain,
% 0.20/0.39 (![X: $i] : p(X) | k!0 | ![X: $i] : (k!0 | p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[38, 13])).
% 0.20/0.39 tff(40,plain,
% 0.20/0.39 (k!0 | ![X: $i] : p(X) | ![X: $i] : (k!0 | p(X))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[39, 12])).
% 0.20/0.39 tff(41,plain,
% 0.20/0.39 (![X: $i] : (k!0 | p(X))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[40, 11, 5])).
% 0.20/0.39 tff(42,plain,
% 0.20/0.39 (((~![X: $i] : (k!0 | p(X))) | (k!0 | p(X!2))) <=> ((~![X: $i] : (k!0 | p(X))) | k!0 | p(X!2))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(43,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) | (k!0 | p(X!2))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(44,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) | k!0 | p(X!2)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[43, 42])).
% 0.20/0.39 tff(45,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[44, 5, 41, 3])).
% 0.20/0.39 tff(46,plain,(k!0 | p(X!2)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.39 tff(47,plain,
% 0.20/0.39 (((~(k!0 | p(X!1))) | ((~k!0) & (~p(X!2)))) <=> ((~(k!0 | p(X!1))) | (~(k!0 | p(X!2))))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(48,plain,
% 0.20/0.39 ((~(k!0 | p(X!1))) | ((~k!0) & (~p(X!2)))),
% 0.20/0.39 inference(and_elim,[status(thm)],[37])).
% 0.20/0.39 tff(49,plain,
% 0.20/0.39 ((~(k!0 | p(X!1))) | (~(k!0 | p(X!2)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[48, 47])).
% 0.20/0.39 tff(50,plain,
% 0.20/0.39 (~(k!0 | p(X!1))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[49, 46])).
% 0.20/0.39 tff(51,plain,
% 0.20/0.39 ((k!0 | p(X!1)) | (~p(X!1))),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(52,plain,
% 0.20/0.39 (~p(X!1)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[51, 50])).
% 0.20/0.39 tff(53,assumption,(![X: $i] : (k!0 | p(X))), introduced(assumption)).
% 0.20/0.39 tff(54,plain,
% 0.20/0.39 ((k!0 | p(X!1)) | (~k!0)),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(55,plain,
% 0.20/0.39 (~k!0),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[54, 50])).
% 0.20/0.39 tff(56,plain,
% 0.20/0.39 (((~![X: $i] : (k!0 | p(X))) | (k!0 | p(X!1))) <=> ((~![X: $i] : (k!0 | p(X))) | k!0 | p(X!1))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(57,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) | (k!0 | p(X!1))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(58,plain,
% 0.20/0.39 ((~![X: $i] : (k!0 | p(X))) | k!0 | p(X!1)),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[57, 56])).
% 0.20/0.39 tff(59,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[58, 55, 53, 52])).
% 0.20/0.39 tff(60,plain,(~![X: $i] : (k!0 | p(X))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.39 tff(61,plain,
% 0.20/0.39 (![X: $i] : p(X) | ![X: $i] : (k!0 | p(X))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[40, 55])).
% 0.20/0.39 tff(62,plain,
% 0.20/0.39 (![X: $i] : p(X)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[61, 60])).
% 0.20/0.39 tff(63,plain,
% 0.20/0.39 ((~![X: $i] : p(X)) | p(X!1)),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(64,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[63, 62, 52])).
% 0.20/0.39 % SZS output end Proof
%------------------------------------------------------------------------------