TSTP Solution File: SYN049-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN049-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n011.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 : Thu Sep 29 23:53:20 EDT 2022
% Result : Unsatisfiable 0.20s 0.38s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN049-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n011.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 01:17:45 EDT 2022
% 0.13/0.33 % 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.20/0.38 % SZS status Unsatisfiable
% 0.20/0.38 % SZS output start Proof
% 0.20/0.38 tff(big_q_type, type, (
% 0.20/0.38 big_q: $i > $o)).
% 0.20/0.38 tff(g_type, type, (
% 0.20/0.38 g: $i > $i)).
% 0.20/0.38 tff(elem_0_type, type, (
% 0.20/0.38 elem_0: $i)).
% 0.20/0.38 tff(big_p_type, type, (
% 0.20/0.38 big_p: $i > $o)).
% 0.20/0.38 tff(f_type, type, (
% 0.20/0.38 f: $i > $i)).
% 0.20/0.38 tff(1,assumption,(~big_p(f(elem!0))), introduced(assumption)).
% 0.20/0.38 tff(2,plain,
% 0.20/0.38 (^[X: $i] : refl(big_p(X) <=> big_p(X))),
% 0.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(3,plain,
% 0.20/0.38 (![X: $i] : big_p(X) <=> ![X: $i] : big_p(X)),
% 0.20/0.38 inference(quant_intro,[status(thm)],[2])).
% 0.20/0.38 tff(4,plain,
% 0.20/0.38 (![X: $i] : big_p(X) <=> ![X: $i] : big_p(X)),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(5,axiom,(![X: $i] : big_p(X)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_2')).
% 0.20/0.38 tff(6,plain,
% 0.20/0.38 (![X: $i] : big_p(X)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.20/0.38 tff(7,plain,(
% 0.20/0.38 ![X: $i] : big_p(X)),
% 0.20/0.38 inference(skolemize,[status(sab)],[6])).
% 0.20/0.38 tff(8,plain,
% 0.20/0.38 (![X: $i] : big_p(X)),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.20/0.38 tff(9,plain,
% 0.20/0.38 ((~![X: $i] : big_p(X)) | big_p(f(elem!0))),
% 0.20/0.38 inference(quant_inst,[status(thm)],[])).
% 0.20/0.38 tff(10,plain,
% 0.20/0.38 ($false),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[9, 8, 1])).
% 0.20/0.38 tff(11,plain,(big_p(f(elem!0))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.38 tff(12,plain,
% 0.20/0.38 (^[X: $i] : refl((big_q(g(X)) | (~big_p(f(X)))) <=> (big_q(g(X)) | (~big_p(f(X)))))),
% 0.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(13,plain,
% 0.20/0.38 (![X: $i] : (big_q(g(X)) | (~big_p(f(X)))) <=> ![X: $i] : (big_q(g(X)) | (~big_p(f(X))))),
% 0.20/0.38 inference(quant_intro,[status(thm)],[12])).
% 0.20/0.38 tff(14,plain,
% 0.20/0.38 (![X: $i] : (big_q(g(X)) | (~big_p(f(X)))) <=> ![X: $i] : (big_q(g(X)) | (~big_p(f(X))))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(15,plain,
% 0.20/0.38 (^[X: $i] : rewrite(((~big_p(f(X))) | big_q(g(X))) <=> (big_q(g(X)) | (~big_p(f(X)))))),
% 0.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(16,plain,
% 0.20/0.38 (![X: $i] : ((~big_p(f(X))) | big_q(g(X))) <=> ![X: $i] : (big_q(g(X)) | (~big_p(f(X))))),
% 0.20/0.38 inference(quant_intro,[status(thm)],[15])).
% 0.20/0.38 tff(17,axiom,(![X: $i] : ((~big_p(f(X))) | big_q(g(X)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_1')).
% 0.20/0.38 tff(18,plain,
% 0.20/0.38 (![X: $i] : (big_q(g(X)) | (~big_p(f(X))))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[17, 16])).
% 0.20/0.38 tff(19,plain,
% 0.20/0.38 (![X: $i] : (big_q(g(X)) | (~big_p(f(X))))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[18, 14])).
% 0.20/0.38 tff(20,plain,(
% 0.20/0.38 ![X: $i] : (big_q(g(X)) | (~big_p(f(X))))),
% 0.20/0.38 inference(skolemize,[status(sab)],[19])).
% 0.20/0.38 tff(21,plain,
% 0.20/0.38 (![X: $i] : (big_q(g(X)) | (~big_p(f(X))))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[20, 13])).
% 0.20/0.38 tff(22,plain,
% 0.20/0.38 (((~![X: $i] : (big_q(g(X)) | (~big_p(f(X))))) | (big_q(g(elem!0)) | (~big_p(f(elem!0))))) <=> ((~![X: $i] : (big_q(g(X)) | (~big_p(f(X))))) | big_q(g(elem!0)) | (~big_p(f(elem!0))))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(23,plain,
% 0.20/0.38 ((~![X: $i] : (big_q(g(X)) | (~big_p(f(X))))) | (big_q(g(elem!0)) | (~big_p(f(elem!0))))),
% 0.20/0.38 inference(quant_inst,[status(thm)],[])).
% 0.20/0.38 tff(24,plain,
% 0.20/0.38 ((~![X: $i] : (big_q(g(X)) | (~big_p(f(X))))) | big_q(g(elem!0)) | (~big_p(f(elem!0)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[23, 22])).
% 0.20/0.38 tff(25,plain,
% 0.20/0.38 (big_q(g(elem!0)) | (~big_p(f(elem!0)))),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[24, 21])).
% 0.20/0.38 tff(26,plain,
% 0.20/0.38 (big_q(g(elem!0))),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[25, 11])).
% 0.20/0.38 tff(27,plain,
% 0.20/0.38 (^[X: $i] : refl((~big_q(X)) <=> (~big_q(X)))),
% 0.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(28,plain,
% 0.20/0.38 (![X: $i] : (~big_q(X)) <=> ![X: $i] : (~big_q(X))),
% 0.20/0.38 inference(quant_intro,[status(thm)],[27])).
% 0.20/0.38 tff(29,plain,
% 0.20/0.38 (![X: $i] : (~big_q(X)) <=> ![X: $i] : (~big_q(X))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(30,axiom,(![X: $i] : (~big_q(X))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','clause_3')).
% 0.20/0.38 tff(31,plain,
% 0.20/0.38 (![X: $i] : (~big_q(X))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[30, 29])).
% 0.20/0.38 tff(32,plain,(
% 0.20/0.38 ![X: $i] : (~big_q(X))),
% 0.20/0.38 inference(skolemize,[status(sab)],[31])).
% 0.20/0.38 tff(33,plain,
% 0.20/0.38 (![X: $i] : (~big_q(X))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[32, 28])).
% 0.20/0.38 tff(34,plain,
% 0.20/0.38 ((~![X: $i] : (~big_q(X))) | (~big_q(g(elem!0)))),
% 0.20/0.38 inference(quant_inst,[status(thm)],[])).
% 0.20/0.38 tff(35,plain,
% 0.20/0.38 ($false),
% 0.20/0.38 inference(unit_resolution,[status(thm)],[34, 33, 26])).
% 0.20/0.38 % SZS output end Proof
%------------------------------------------------------------------------------