TSTP Solution File: SYN920+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n008.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:16 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN920+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 : n008.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:38:25 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.13/0.39 % SZS status Theorem
% 0.13/0.39 % SZS output start Proof
% 0.13/0.39 tff(h_type, type, (
% 0.13/0.39 h: $i > $o)).
% 0.13/0.39 tff(tptp_fun_X_1_type, type, (
% 0.13/0.39 tptp_fun_X_1: $i)).
% 0.13/0.39 tff(f_type, type, (
% 0.13/0.39 f: $i > $o)).
% 0.13/0.39 tff(g_type, type, (
% 0.13/0.39 g: $i > $o)).
% 0.13/0.39 tff(tptp_fun_X_0_type, type, (
% 0.13/0.39 tptp_fun_X_0: $i)).
% 0.13/0.39 tff(1,assumption,(~(h(X!0) | (~f(X!0)) | (~g(X!0)))), introduced(assumption)).
% 0.13/0.39 tff(2,plain,
% 0.13/0.39 ((h(X!0) | (~f(X!0)) | (~g(X!0))) | g(X!0)),
% 0.13/0.39 inference(tautology,[status(thm)],[])).
% 0.13/0.39 tff(3,plain,
% 0.13/0.39 (g(X!0)),
% 0.13/0.39 inference(unit_resolution,[status(thm)],[2, 1])).
% 0.13/0.39 tff(4,plain,
% 0.13/0.39 ((h(X!0) | (~f(X!0)) | (~g(X!0))) | f(X!0)),
% 0.13/0.39 inference(tautology,[status(thm)],[])).
% 0.13/0.39 tff(5,plain,
% 0.13/0.39 (f(X!0)),
% 0.13/0.39 inference(unit_resolution,[status(thm)],[4, 1])).
% 0.13/0.39 tff(6,plain,
% 0.13/0.39 ((h(X!0) | (~f(X!0)) | (~g(X!0))) | (~h(X!0))),
% 0.13/0.39 inference(tautology,[status(thm)],[])).
% 0.13/0.39 tff(7,plain,
% 0.13/0.39 (~h(X!0)),
% 0.13/0.39 inference(unit_resolution,[status(thm)],[6, 1])).
% 0.13/0.39 tff(8,plain,
% 0.13/0.39 (^[V: $i] : refl(((~g(V)) | h(V) | (~f(V))) <=> ((~g(V)) | h(V) | (~f(V))))),
% 0.13/0.39 inference(bind,[status(th)],[])).
% 0.13/0.39 tff(9,plain,
% 0.13/0.39 (![V: $i] : ((~g(V)) | h(V) | (~f(V))) <=> ![V: $i] : ((~g(V)) | h(V) | (~f(V)))),
% 0.13/0.39 inference(quant_intro,[status(thm)],[8])).
% 0.13/0.39 tff(10,plain,
% 0.13/0.39 (^[V: $i] : trans(monotonicity(rewrite((f(V) & g(V) & (~h(V))) <=> (~((~g(V)) | h(V) | (~f(V))))), ((~(f(V) & g(V) & (~h(V)))) <=> (~(~((~g(V)) | h(V) | (~f(V))))))), rewrite((~(~((~g(V)) | h(V) | (~f(V))))) <=> ((~g(V)) | h(V) | (~f(V)))), ((~(f(V) & g(V) & (~h(V)))) <=> ((~g(V)) | h(V) | (~f(V)))))),
% 0.13/0.39 inference(bind,[status(th)],[])).
% 0.13/0.39 tff(11,plain,
% 0.13/0.39 (![V: $i] : (~(f(V) & g(V) & (~h(V)))) <=> ![V: $i] : ((~g(V)) | h(V) | (~f(V)))),
% 0.13/0.39 inference(quant_intro,[status(thm)],[10])).
% 0.13/0.39 tff(12,plain,
% 0.13/0.39 ((~?[V: $i] : (f(V) & g(V) & (~h(V)))) <=> (~?[V: $i] : (f(V) & g(V) & (~h(V))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(13,plain,
% 0.13/0.39 ((~(((![X: $i] : ((f(X) & g(X)) => h(X)) => ?[X: $i] : (f(X) & (~g(X)))) & (![W: $i] : (f(W) => g(W)) | ![Z: $i] : (f(Z) => h(Z)))) => (![R: $i] : ((f(R) & h(R)) => g(R)) => ?[V: $i] : ((f(V) & g(V)) & (~h(V)))))) <=> (~(?[V: $i] : (f(V) & g(V) & (~h(V))) | (~![R: $i] : (g(R) | (~(f(R) & h(R))))) | (~(((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))) & (![W: $i] : (g(W) | (~f(W))) | ![Z: $i] : (h(Z) | (~f(Z))))))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(14,axiom,(~(((![X: $i] : ((f(X) & g(X)) => h(X)) => ?[X: $i] : (f(X) & (~g(X)))) & (![W: $i] : (f(W) => g(W)) | ![Z: $i] : (f(Z) => h(Z)))) => (![R: $i] : ((f(R) & h(R)) => g(R)) => ?[V: $i] : ((f(V) & g(V)) & (~h(V)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_this')).
% 0.13/0.39 tff(15,plain,
% 0.13/0.39 (~(?[V: $i] : (f(V) & g(V) & (~h(V))) | (~![R: $i] : (g(R) | (~(f(R) & h(R))))) | (~(((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))) & (![W: $i] : (g(W) | (~f(W))) | ![Z: $i] : (h(Z) | (~f(Z)))))))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[14, 13])).
% 0.13/0.39 tff(16,plain,
% 0.13/0.39 (~?[V: $i] : (f(V) & g(V) & (~h(V)))),
% 0.13/0.39 inference(or_elim,[status(thm)],[15])).
% 0.13/0.39 tff(17,plain,
% 0.13/0.39 (~?[V: $i] : (f(V) & g(V) & (~h(V)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.13/0.39 tff(18,plain,
% 0.13/0.39 (~?[V: $i] : (f(V) & g(V) & (~h(V)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[17, 12])).
% 0.13/0.39 tff(19,plain,
% 0.13/0.39 (~?[V: $i] : (f(V) & g(V) & (~h(V)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[18, 12])).
% 0.13/0.39 tff(20,plain,
% 0.13/0.39 (~?[V: $i] : (f(V) & g(V) & (~h(V)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[19, 12])).
% 0.13/0.39 tff(21,plain,
% 0.13/0.39 (~?[V: $i] : (f(V) & g(V) & (~h(V)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[20, 12])).
% 0.13/0.39 tff(22,plain,
% 0.13/0.39 (~?[V: $i] : (f(V) & g(V) & (~h(V)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[21, 12])).
% 0.13/0.39 tff(23,plain,
% 0.13/0.39 (^[V: $i] : refl($oeq((~(f(V) & g(V) & (~h(V)))), (~(f(V) & g(V) & (~h(V))))))),
% 0.13/0.39 inference(bind,[status(th)],[])).
% 0.13/0.39 tff(24,plain,(
% 0.13/0.39 ![V: $i] : (~(f(V) & g(V) & (~h(V))))),
% 0.13/0.39 inference(nnf-neg,[status(sab)],[22, 23])).
% 0.13/0.39 tff(25,plain,
% 0.13/0.39 (![V: $i] : ((~g(V)) | h(V) | (~f(V)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[24, 11])).
% 0.13/0.39 tff(26,plain,
% 0.13/0.39 (![V: $i] : ((~g(V)) | h(V) | (~f(V)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[25, 9])).
% 0.13/0.39 tff(27,plain,
% 0.13/0.39 (((~![V: $i] : ((~g(V)) | h(V) | (~f(V)))) | (h(X!0) | (~f(X!0)) | (~g(X!0)))) <=> ((~![V: $i] : ((~g(V)) | h(V) | (~f(V)))) | h(X!0) | (~f(X!0)) | (~g(X!0)))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(28,plain,
% 0.13/0.39 (((~g(X!0)) | h(X!0) | (~f(X!0))) <=> (h(X!0) | (~f(X!0)) | (~g(X!0)))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(29,plain,
% 0.13/0.39 (((~![V: $i] : ((~g(V)) | h(V) | (~f(V)))) | ((~g(X!0)) | h(X!0) | (~f(X!0)))) <=> ((~![V: $i] : ((~g(V)) | h(V) | (~f(V)))) | (h(X!0) | (~f(X!0)) | (~g(X!0))))),
% 0.13/0.39 inference(monotonicity,[status(thm)],[28])).
% 0.13/0.39 tff(30,plain,
% 0.13/0.39 (((~![V: $i] : ((~g(V)) | h(V) | (~f(V)))) | ((~g(X!0)) | h(X!0) | (~f(X!0)))) <=> ((~![V: $i] : ((~g(V)) | h(V) | (~f(V)))) | h(X!0) | (~f(X!0)) | (~g(X!0)))),
% 0.13/0.39 inference(transitivity,[status(thm)],[29, 27])).
% 0.13/0.39 tff(31,plain,
% 0.13/0.39 ((~![V: $i] : ((~g(V)) | h(V) | (~f(V)))) | ((~g(X!0)) | h(X!0) | (~f(X!0)))),
% 0.13/0.39 inference(quant_inst,[status(thm)],[])).
% 0.13/0.39 tff(32,plain,
% 0.13/0.39 ((~![V: $i] : ((~g(V)) | h(V) | (~f(V)))) | h(X!0) | (~f(X!0)) | (~g(X!0))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[31, 30])).
% 0.13/0.39 tff(33,plain,
% 0.13/0.39 ($false),
% 0.13/0.39 inference(unit_resolution,[status(thm)],[32, 26, 7, 5, 3])).
% 0.13/0.39 tff(34,plain,(h(X!0) | (~f(X!0)) | (~g(X!0))), inference(lemma,lemma(discharge,[]))).
% 0.13/0.39 tff(35,plain,
% 0.13/0.39 (((~(h(X!0) | (~f(X!0)) | (~g(X!0)))) | (~(g(X!1) | (~f(X!1))))) <=> ((~(g(X!1) | (~f(X!1)))) | (~(h(X!0) | (~f(X!0)) | (~g(X!0)))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(36,plain,
% 0.13/0.39 ((f(X!1) & (~g(X!1))) <=> (~(g(X!1) | (~f(X!1))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(37,plain,
% 0.13/0.39 ((~(h(X!0) | (~(f(X!0) & g(X!0))))) <=> (~(h(X!0) | (~f(X!0)) | (~g(X!0))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(38,plain,
% 0.13/0.39 (((~(h(X!0) | (~(f(X!0) & g(X!0))))) | (f(X!1) & (~g(X!1)))) <=> ((~(h(X!0) | (~f(X!0)) | (~g(X!0)))) | (~(g(X!1) | (~f(X!1)))))),
% 0.13/0.39 inference(monotonicity,[status(thm)],[37, 36])).
% 0.13/0.39 tff(39,plain,
% 0.13/0.39 (((~(h(X!0) | (~(f(X!0) & g(X!0))))) | (f(X!1) & (~g(X!1)))) <=> ((~(g(X!1) | (~f(X!1)))) | (~(h(X!0) | (~f(X!0)) | (~g(X!0)))))),
% 0.13/0.39 inference(transitivity,[status(thm)],[38, 35])).
% 0.13/0.39 tff(40,plain,
% 0.13/0.39 (((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))) <=> ((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X))))),
% 0.13/0.39 inference(rewrite,[status(thm)],[])).
% 0.13/0.39 tff(41,plain,
% 0.13/0.39 (((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))) & (![W: $i] : (g(W) | (~f(W))) | ![Z: $i] : (h(Z) | (~f(Z))))),
% 0.13/0.39 inference(or_elim,[status(thm)],[15])).
% 0.13/0.39 tff(42,plain,
% 0.13/0.39 ((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))),
% 0.13/0.39 inference(and_elim,[status(thm)],[41])).
% 0.13/0.39 tff(43,plain,
% 0.13/0.39 ((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[42, 40])).
% 0.13/0.39 tff(44,plain,
% 0.13/0.39 ((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[43, 40])).
% 0.13/0.39 tff(45,plain,
% 0.13/0.39 ((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[44, 40])).
% 0.13/0.39 tff(46,plain,
% 0.13/0.39 ((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[45, 40])).
% 0.13/0.39 tff(47,plain,
% 0.13/0.39 ((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[46, 40])).
% 0.13/0.39 tff(48,plain,
% 0.13/0.39 ((~![X: $i] : (h(X) | (~(f(X) & g(X))))) | ?[X: $i] : (f(X) & (~g(X)))),
% 0.13/0.39 inference(modus_ponens,[status(thm)],[47, 40])).
% 0.13/0.39 Proof display could not be completed: monotonicity rule is not handled
%------------------------------------------------------------------------------