TSTP Solution File: SYN378+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN378+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n006.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:55:03 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.03/0.12 % Problem : SYN378+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n006.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 02:57:53 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.21/0.39 % SZS status Theorem
% 0.21/0.39 % SZS output start Proof
% 0.21/0.39 tff(big_p_type, type, (
% 0.21/0.39 big_p: $i > $o)).
% 0.21/0.39 tff(tptp_fun_Y_0_type, type, (
% 0.21/0.39 tptp_fun_Y_0: $i)).
% 0.21/0.39 tff(big_q_type, type, (
% 0.21/0.39 big_q: $i > $o)).
% 0.21/0.39 tff(1,plain,
% 0.21/0.39 (?[Y: $i] : big_q(Y) <=> ?[Y: $i] : big_q(Y)),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(2,plain,
% 0.21/0.39 ((~(![X: $i] : big_p(X) => ((~?[Y: $i] : big_q(Y)) | ?[Z: $i] : (big_p(Z) => big_q(Z))))) <=> (~((~?[Y: $i] : big_q(Y)) | ?[Z: $i] : (big_q(Z) | (~big_p(Z))) | (~![X: $i] : big_p(X))))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(3,axiom,(~(![X: $i] : big_p(X) => ((~?[Y: $i] : big_q(Y)) | ?[Z: $i] : (big_p(Z) => big_q(Z))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','x2130')).
% 0.21/0.39 tff(4,plain,
% 0.21/0.39 (~((~?[Y: $i] : big_q(Y)) | ?[Z: $i] : (big_q(Z) | (~big_p(Z))) | (~![X: $i] : big_p(X)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.21/0.39 tff(5,plain,
% 0.21/0.39 (?[Y: $i] : big_q(Y)),
% 0.21/0.39 inference(or_elim,[status(thm)],[4])).
% 0.21/0.39 tff(6,plain,
% 0.21/0.39 (?[Y: $i] : big_q(Y)),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.21/0.39 tff(7,plain,(
% 0.21/0.39 big_q(Y!0)),
% 0.21/0.39 inference(skolemize,[status(sab)],[6])).
% 0.21/0.39 tff(8,plain,
% 0.21/0.39 ((big_q(Y!0) | (~big_p(Y!0))) | (~big_q(Y!0))),
% 0.21/0.39 inference(tautology,[status(thm)],[])).
% 0.21/0.39 tff(9,plain,
% 0.21/0.39 (big_q(Y!0) | (~big_p(Y!0))),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.21/0.39 tff(10,plain,
% 0.21/0.39 (^[Z: $i] : refl((~(big_q(Z) | (~big_p(Z)))) <=> (~(big_q(Z) | (~big_p(Z)))))),
% 0.21/0.39 inference(bind,[status(th)],[])).
% 0.21/0.39 tff(11,plain,
% 0.21/0.39 (![Z: $i] : (~(big_q(Z) | (~big_p(Z)))) <=> ![Z: $i] : (~(big_q(Z) | (~big_p(Z))))),
% 0.21/0.39 inference(quant_intro,[status(thm)],[10])).
% 0.21/0.39 tff(12,plain,
% 0.21/0.39 ((~?[Z: $i] : (big_q(Z) | (~big_p(Z)))) <=> (~?[Z: $i] : (big_q(Z) | (~big_p(Z))))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(13,plain,
% 0.21/0.39 (~?[Z: $i] : (big_q(Z) | (~big_p(Z)))),
% 0.21/0.39 inference(or_elim,[status(thm)],[4])).
% 0.21/0.39 tff(14,plain,
% 0.21/0.39 (~?[Z: $i] : (big_q(Z) | (~big_p(Z)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.21/0.39 tff(15,plain,
% 0.21/0.39 (~?[Z: $i] : (big_q(Z) | (~big_p(Z)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[14, 12])).
% 0.21/0.39 tff(16,plain,
% 0.21/0.39 (~?[Z: $i] : (big_q(Z) | (~big_p(Z)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[15, 12])).
% 0.21/0.39 tff(17,plain,
% 0.21/0.39 (~?[Z: $i] : (big_q(Z) | (~big_p(Z)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.21/0.39 tff(18,plain,
% 0.21/0.39 (~?[Z: $i] : (big_q(Z) | (~big_p(Z)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[17, 12])).
% 0.21/0.39 tff(19,plain,
% 0.21/0.39 (~?[Z: $i] : (big_q(Z) | (~big_p(Z)))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[18, 12])).
% 0.21/0.39 tff(20,plain,
% 0.21/0.39 (^[Z: $i] : refl($oeq((~(big_q(Z) | (~big_p(Z)))), (~(big_q(Z) | (~big_p(Z))))))),
% 0.21/0.39 inference(bind,[status(th)],[])).
% 0.21/0.39 tff(21,plain,(
% 0.21/0.39 ![Z: $i] : (~(big_q(Z) | (~big_p(Z))))),
% 0.21/0.39 inference(nnf-neg,[status(sab)],[19, 20])).
% 0.21/0.39 tff(22,plain,
% 0.21/0.39 (![Z: $i] : (~(big_q(Z) | (~big_p(Z))))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[21, 11])).
% 0.21/0.39 tff(23,plain,
% 0.21/0.39 ((~![Z: $i] : (~(big_q(Z) | (~big_p(Z))))) | (~(big_q(Y!0) | (~big_p(Y!0))))),
% 0.21/0.39 inference(quant_inst,[status(thm)],[])).
% 0.21/0.39 tff(24,plain,
% 0.21/0.39 ($false),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[23, 22, 9])).
% 0.21/0.39 % SZS output end Proof
%------------------------------------------------------------------------------