TSTP Solution File: SYN957+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN957+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n004.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:23 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN957+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n004.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:19 EDT 2022
% 0.13/0.35 % 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.20/0.39 % SZS status Theorem
% 0.20/0.39 % SZS output start Proof
% 0.20/0.39 tff(a_type, type, (
% 0.20/0.39 a: ( $i * $i ) > $o)).
% 0.20/0.39 tff(tptp_fun_Y_0_type, type, (
% 0.20/0.39 tptp_fun_Y_0: $i)).
% 0.20/0.39 tff(1,plain,
% 0.20/0.39 (((~![X: $i] : (a(X, Y!0) <=> (~a(X, X)))) | $false) <=> (~![X: $i] : (a(X, Y!0) <=> (~a(X, X))))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(2,plain,
% 0.20/0.39 ((a(Y!0, Y!0) <=> (~a(Y!0, Y!0))) <=> $false),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(3,plain,
% 0.20/0.39 (((~![X: $i] : (a(X, Y!0) <=> (~a(X, X)))) | (a(Y!0, Y!0) <=> (~a(Y!0, Y!0)))) <=> ((~![X: $i] : (a(X, Y!0) <=> (~a(X, X)))) | $false)),
% 0.20/0.39 inference(monotonicity,[status(thm)],[2])).
% 0.20/0.39 tff(4,plain,
% 0.20/0.39 (((~![X: $i] : (a(X, Y!0) <=> (~a(X, X)))) | (a(Y!0, Y!0) <=> (~a(Y!0, Y!0)))) <=> (~![X: $i] : (a(X, Y!0) <=> (~a(X, X))))),
% 0.20/0.39 inference(transitivity,[status(thm)],[3, 1])).
% 0.20/0.39 tff(5,plain,
% 0.20/0.39 ((~![X: $i] : (a(X, Y!0) <=> (~a(X, X)))) | (a(Y!0, Y!0) <=> (~a(Y!0, Y!0)))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(6,plain,
% 0.20/0.39 (~![X: $i] : (a(X, Y!0) <=> (~a(X, X)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.20/0.39 tff(7,plain,
% 0.20/0.39 (^[X: $i] : refl((a(X, Y!0) <=> (~a(X, X))) <=> (a(X, Y!0) <=> (~a(X, X))))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(8,plain,
% 0.20/0.39 (![X: $i] : (a(X, Y!0) <=> (~a(X, X))) <=> ![X: $i] : (a(X, Y!0) <=> (~a(X, X)))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[7])).
% 0.20/0.39 tff(9,plain,
% 0.20/0.39 (?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X))) <=> ?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(10,plain,
% 0.20/0.39 ((~(~?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X))))) <=> ?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(11,plain,
% 0.20/0.39 ((~?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X)))) <=> (~?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X))))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(12,plain,
% 0.20/0.39 ((~(~?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X))))) <=> (~(~?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X)))))),
% 0.20/0.39 inference(monotonicity,[status(thm)],[11])).
% 0.20/0.39 tff(13,plain,
% 0.20/0.39 ((~(~?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X))))) <=> ?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X)))),
% 0.20/0.39 inference(transitivity,[status(thm)],[12, 10])).
% 0.20/0.39 tff(14,axiom,(~(~?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.20/0.39 tff(15,plain,
% 0.20/0.39 (?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[14, 13])).
% 0.20/0.39 tff(16,plain,
% 0.20/0.39 (?[Y: $i] : ![X: $i] : (a(X, Y) <=> (~a(X, X)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[15, 9])).
% 0.20/0.39 tff(17,plain,(
% 0.20/0.39 $oeq(![X: $i] : (a(X, Y!0) <=> (~a(X, X))), ![X: $i] : (a(X, Y!0) <=> (~a(X, X))))),
% 0.20/0.39 inference(transitivity,[status(sab)],[16])).
% 0.20/0.39 tff(18,plain,
% 0.20/0.39 (![X: $i] : (a(X, Y!0) <=> (~a(X, X)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[17, 8])).
% 0.20/0.39 tff(19,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[18, 6])).
% 0.20/0.39 % SZS output end Proof
%------------------------------------------------------------------------------