TSTP Solution File: SYN971+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN971+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n022.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:26 EDT 2022
% Result : Theorem 0.21s 0.39s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN971+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Sep 5 09:46:39 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35 Usage: tptp [options] [-file:]file
% 0.14/0.35 -h, -? prints this message.
% 0.14/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.35 -m, -model generate model.
% 0.14/0.35 -p, -proof generate proof.
% 0.14/0.35 -c, -core generate unsat core of named formulas.
% 0.14/0.35 -st, -statistics display statistics.
% 0.14/0.35 -t:timeout set timeout (in second).
% 0.14/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35 -<param>:<value> configuration parameter and value.
% 0.14/0.35 -o:<output-file> file to place output in.
% 0.21/0.39 % SZS status Theorem
% 0.21/0.39 % SZS output start Proof
% 0.21/0.39 tff(p_type, type, (
% 0.21/0.39 p: $i > $o)).
% 0.21/0.39 tff(tptp_fun_X_0_type, type, (
% 0.21/0.39 tptp_fun_X_0: $i)).
% 0.21/0.39 tff(1,plain,
% 0.21/0.39 (((~![Y: $i] : (~(p(Y) | (~p(X!0))))) | $false) <=> (~![Y: $i] : (~(p(Y) | (~p(X!0)))))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(2,plain,
% 0.21/0.39 ((~$true) <=> $false),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(3,plain,
% 0.21/0.39 ((p(X!0) | (~p(X!0))) <=> $true),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(4,plain,
% 0.21/0.39 ((~(p(X!0) | (~p(X!0)))) <=> (~$true)),
% 0.21/0.39 inference(monotonicity,[status(thm)],[3])).
% 0.21/0.39 tff(5,plain,
% 0.21/0.39 ((~(p(X!0) | (~p(X!0)))) <=> $false),
% 0.21/0.39 inference(transitivity,[status(thm)],[4, 2])).
% 0.21/0.39 tff(6,plain,
% 0.21/0.39 (((~![Y: $i] : (~(p(Y) | (~p(X!0))))) | (~(p(X!0) | (~p(X!0))))) <=> ((~![Y: $i] : (~(p(Y) | (~p(X!0))))) | $false)),
% 0.21/0.39 inference(monotonicity,[status(thm)],[5])).
% 0.21/0.39 tff(7,plain,
% 0.21/0.39 (((~![Y: $i] : (~(p(Y) | (~p(X!0))))) | (~(p(X!0) | (~p(X!0))))) <=> (~![Y: $i] : (~(p(Y) | (~p(X!0)))))),
% 0.21/0.39 inference(transitivity,[status(thm)],[6, 1])).
% 0.21/0.39 tff(8,plain,
% 0.21/0.39 ((~![Y: $i] : (~(p(Y) | (~p(X!0))))) | (~(p(X!0) | (~p(X!0))))),
% 0.21/0.39 inference(quant_inst,[status(thm)],[])).
% 0.21/0.39 tff(9,plain,
% 0.21/0.39 (~![Y: $i] : (~(p(Y) | (~p(X!0))))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[8, 7])).
% 0.21/0.39 tff(10,plain,
% 0.21/0.39 (^[Y: $i] : refl((~(p(Y) | (~p(X!0)))) <=> (~(p(Y) | (~p(X!0)))))),
% 0.21/0.39 inference(bind,[status(th)],[])).
% 0.21/0.39 tff(11,plain,
% 0.21/0.39 (![Y: $i] : (~(p(Y) | (~p(X!0)))) <=> ![Y: $i] : (~(p(Y) | (~p(X!0))))),
% 0.21/0.39 inference(quant_intro,[status(thm)],[10])).
% 0.21/0.39 tff(12,plain,
% 0.21/0.39 (^[Y: $i] : rewrite(((~p(Y)) & p(X!0)) <=> (~(p(Y) | (~p(X!0)))))),
% 0.21/0.39 inference(bind,[status(th)],[])).
% 0.21/0.39 tff(13,plain,
% 0.21/0.39 (![Y: $i] : ((~p(Y)) & p(X!0)) <=> ![Y: $i] : (~(p(Y) | (~p(X!0))))),
% 0.21/0.39 inference(quant_intro,[status(thm)],[12])).
% 0.21/0.39 tff(14,plain,
% 0.21/0.39 ((~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X)))) <=> (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X))))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(15,plain,
% 0.21/0.39 ((~?[Y: $i] : (?[X: $i] : p(X) => p(Y))) <=> (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X))))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(16,axiom,(~?[Y: $i] : (?[X: $i] : p(X) => p(Y))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_this')).
% 0.21/0.39 tff(17,plain,
% 0.21/0.39 (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[16, 15])).
% 0.21/0.39 tff(18,plain,
% 0.21/0.39 (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[17, 14])).
% 0.21/0.39 tff(19,plain,
% 0.21/0.39 (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[18, 14])).
% 0.21/0.39 tff(20,plain,
% 0.21/0.39 (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[19, 14])).
% 0.21/0.39 tff(21,plain,
% 0.21/0.39 (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[20, 14])).
% 0.21/0.39 tff(22,plain,
% 0.21/0.39 (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[21, 14])).
% 0.21/0.39 tff(23,plain,
% 0.21/0.39 (~?[Y: $i] : (p(Y) | (~?[X: $i] : p(X)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[22, 14])).
% 0.21/0.39 tff(24,plain,
% 0.21/0.39 (^[Y: $i] : nnf_neg(refl($oeq((~p(Y)), (~p(Y)))), nnf_neg(sk($oeq(?[X: $i] : p(X), p(X!0))), $oeq((~(~?[X: $i] : p(X))), p(X!0))), $oeq((~(p(Y) | (~?[X: $i] : p(X)))), ((~p(Y)) & p(X!0))))),
% 0.21/0.39 inference(bind,[status(th)],[])).
% 0.21/0.39 tff(25,plain,(
% 0.21/0.39 ![Y: $i] : ((~p(Y)) & p(X!0))),
% 0.21/0.39 inference(nnf-neg,[status(sab)],[23, 24])).
% 0.21/0.39 tff(26,plain,
% 0.21/0.39 (![Y: $i] : (~(p(Y) | (~p(X!0))))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[25, 13])).
% 0.21/0.39 tff(27,plain,
% 0.21/0.39 (![Y: $i] : (~(p(Y) | (~p(X!0))))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[26, 11])).
% 0.21/0.39 tff(28,plain,
% 0.21/0.39 ($false),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[27, 9])).
% 0.21/0.39 % SZS output end Proof
%------------------------------------------------------------------------------