%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SYN927+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% 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 : Sat Jun 21 05:41:01 AM UTC 2025
% Result : Theorem 0.20s 0.37s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN927+1 : TPTP v9.0.0. Released v3.1.0.
% 0.04/0.12 % Command : run_E %s %d THM
% 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 : Fri Jun 20 13:01:27 EDT 2025
% 0.13/0.33 % CPUTime :
% 0.20/0.37 % SZS status Theorem
% 0.20/0.37 % SZS output start Proof
% 0.20/0.37 tff(p_type, type, (
% 0.20/0.37 p: $i > $o)).
% 0.20/0.37 tff(tptp_fun_Y_0_type, type, (
% 0.20/0.37 tptp_fun_Y_0: $i)).
% 0.20/0.37 tff(1,plain,
% 0.20/0.37 (^[X: $i] : refl(p(X) <=> p(X))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(2,plain,
% 0.20/0.37 (![X: $i] : p(X) <=> ![X: $i] : p(X)),
% 0.20/0.37 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.37 tff(3,plain,
% 0.20/0.37 (((~p(Y!0)) & ![X: $i] : p(X)) <=> ((~p(Y!0)) & ![X: $i] : p(X))),
% 0.20/0.37 inference(rewrite,[status(thm)],[])).
% 0.20/0.37 tff(4,plain,
% 0.20/0.37 ((~![Y: $i] : (p(Y) | (~![X: $i] : p(X)))) <=> (~![Y: $i] : (p(Y) | (~![X: $i] : p(X))))),
% 0.20/0.37 inference(rewrite,[status(thm)],[])).
% 0.20/0.37 tff(5,plain,
% 0.20/0.37 ((~![Y: $i] : (![X: $i] : p(X) => p(Y))) <=> (~![Y: $i] : (p(Y) | (~![X: $i] : p(X))))),
% 0.20/0.37 inference(rewrite,[status(thm)],[])).
% 0.20/0.37 tff(6,axiom,(~![Y: $i] : (![X: $i] : p(X) => p(Y))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_this')).
% 0.20/0.37 tff(7,plain,
% 0.20/0.37 (~![Y: $i] : (p(Y) | (~![X: $i] : p(X)))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.20/0.37 tff(8,plain,
% 0.20/0.37 (~![Y: $i] : (p(Y) | (~![X: $i] : p(X)))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[7, 4])).
% 0.20/0.37 tff(9,plain,
% 0.20/0.37 (~![Y: $i] : (p(Y) | (~![X: $i] : p(X)))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[8, 4])).
% 0.20/0.37 tff(10,plain,
% 0.20/0.37 (~![Y: $i] : (p(Y) | (~![X: $i] : p(X)))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[9, 4])).
% 0.20/0.37 tff(11,plain,
% 0.20/0.37 ((~p(Y!0)) & ![X: $i] : p(X)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[10, 3])).
% 0.20/0.37 tff(12,plain,
% 0.20/0.37 (![X: $i] : p(X)),
% 0.20/0.37 inference(and_elim,[status(thm)],[11])).
% 0.20/0.37 tff(13,plain,
% 0.20/0.37 (![X: $i] : p(X)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[12, 2])).
% 0.20/0.37 tff(14,plain,
% 0.20/0.37 (~p(Y!0)),
% 0.20/0.37 inference(and_elim,[status(thm)],[11])).
% 0.20/0.37 tff(15,plain,
% 0.20/0.37 ((~![X: $i] : p(X)) | p(Y!0)),
% 0.20/0.37 inference(quant_inst,[status(thm)],[])).
% 0.20/0.37 tff(16,plain,
% 0.20/0.37 ($false),
% 0.20/0.37 inference(unit_resolution,[status(thm)],[15, 14, 13])).
% 0.20/0.37 % SZS output end Proof
% 0.20/0.37 % E exiting
%------------------------------------------------------------------------------