%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SYN963+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n009.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:05 AM UTC 2025
% Result : Theorem 0.19s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN963+1 : TPTP v9.0.0. Released v3.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 20 13:01:48 EDT 2025
% 0.11/0.33 % CPUTime :
% 0.19/0.36 % SZS status Theorem
% 0.19/0.36 % SZS output start Proof
% 0.19/0.36 tff(p_type, type, (
% 0.19/0.36 p: $i > $o)).
% 0.19/0.36 tff(tptp_fun_Y_1_type, type, (
% 0.19/0.36 tptp_fun_Y_1: $i)).
% 0.19/0.36 tff(tptp_fun_X_0_type, type, (
% 0.19/0.36 tptp_fun_X_0: $i)).
% 0.19/0.36 tff(1,assumption,(![X: $i] : (~p(X))), introduced(assumption)).
% 0.19/0.36 tff(2,assumption,(p(X!0)), introduced(assumption)).
% 0.19/0.36 tff(3,plain,
% 0.19/0.36 ((~![X: $i] : (~p(X))) | (~p(X!0))),
% 0.19/0.36 inference(quant_inst,[status(thm)],[])).
% 0.19/0.36 tff(4,plain,
% 0.19/0.36 ($false),
% 0.19/0.36 inference(unit_resolution,[status(thm)],[3, 2, 1])).
% 0.19/0.36 tff(5,plain,((~p(X!0)) | (~![X: $i] : (~p(X)))), inference(lemma,lemma(discharge,[]))).
% 0.19/0.36 tff(6,plain,
% 0.19/0.36 (~p(X!0)),
% 0.19/0.36 inference(unit_resolution,[status(thm)],[5, 1])).
% 0.19/0.36 tff(7,plain,
% 0.19/0.36 ((![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y))) <=> (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y)))),
% 0.19/0.36 inference(rewrite,[status(thm)],[])).
% 0.19/0.36 tff(8,plain,
% 0.19/0.36 (((p(X!0) | p(Y!1)) & (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y)))) <=> ((p(X!0) | p(Y!1)) & (![X: $i] : (~p(X)) | ![Y: $i] : (~p(Y))))),
% 0.19/0.36 inference(monotonicity,[status(thm)],[7])).
% 0.19/0.36 tff(9,plain,
% 0.19/0.36 ((~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))) <=> (~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y)))),
% 0.19/0.36 inference(rewrite,[status(thm)],[])).
% 0.19/0.36 tff(10,plain,
% 0.19/0.36 ((?[X: $i] : p(X) <=> ?[Y: $i] : p(Y)) <=> (?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))),
% 0.19/0.36 inference(rewrite,[status(thm)],[])).
% 0.19/0.36 tff(11,plain,
% 0.19/0.36 ((~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))) <=> (~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y)))),
% 0.19/0.36 inference(monotonicity,[status(thm)],[10])).
% 0.19/0.36 tff(12,plain,
% 0.19/0.36 ((~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))) <=> (~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y)))),
% 0.19/0.36 inference(transitivity,[status(thm)],[11, 9])).
% 0.19/0.36 tff(13,axiom,(~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.19/0.36 tff(14,plain,
% 0.19/0.36 (~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.19/0.36 tff(15,plain,
% 0.19/0.36 (~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[14, 12])).
% 0.19/0.36 tff(16,plain,
% 0.19/0.36 (~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[15, 9])).
% 0.19/0.36 tff(17,plain,
% 0.19/0.36 (~(?[X: $i] : p(X) <=> ?[Y: $i] : p(Y))),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.19/0.36 unexpected number of arguments: (let ((a!1 (exists ((X $i)) (p X)))
% 0.19/0.36 (a!2 (lambda ((X $i)) (refl (~ (not (p X)) (not (p X))))))
% 0.19/0.36 (a!3 (forall ((X $i)) (not (p X))))
% 0.19/0.36 (a!4 (exists ((Y $i)) (p Y)))
% 0.19/0.36 (a!5 (lambda ((Y $i)) (refl (~ (not (p Y)) (not (p Y))))))
% 0.19/0.36 (a!6 (forall ((Y $i)) (not (p Y)))))
% 0.19/0.36 (let ((a!7 (~ (not (= a!1 a!4)) (and (or (p X!0) (p Y!1)) (or a!3 a!6)))))
% 0.19/0.36 (nnf-neg (sk (~ a!1 (p X!0)))
% 0.19/0.36 (nnf-neg (proof-bind a!2) (~ (not a!1) a!3))
% 0.19/0.36 (sk (~ a!4 (p Y!1)))
% 0.19/0.36 (nnf-neg (proof-bind a!5) (~ (not a!4) a!6))
% 0.19/0.36 a!7)))
% 0.19/0.36 Proof display could not be completed: unexpected number of arguments
% 0.19/0.37 % E exiting
%------------------------------------------------------------------------------