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