%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SYN962+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% 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 : 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.02/0.12 % Problem : SYN962+1 : TPTP v9.0.0. Released v3.1.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 20 13:01:35 EDT 2025
% 0.12/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_X_0_type, type, (
% 0.19/0.36 tptp_fun_X_0: $i)).
% 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(1,assumption,(~p(Y!1)), introduced(assumption)).
% 0.19/0.36 tff(2,plain,
% 0.19/0.36 (^[X: $i] : refl(p(X) <=> p(X))),
% 0.19/0.36 inference(bind,[status(th)],[])).
% 0.19/0.36 tff(3,plain,
% 0.19/0.36 (![X: $i] : p(X) <=> ![X: $i] : p(X)),
% 0.19/0.36 inference(quant_intro,[status(thm)],[2])).
% 0.19/0.36 tff(4,plain,
% 0.19/0.36 (![X: $i] : p(X) <=> ![X: $i] : p(X)),
% 0.19/0.36 inference(rewrite,[status(thm)],[])).
% 0.19/0.36 tff(5,plain,
% 0.19/0.36 ((~(![X: $i] : p(X) => (![X: $i] : p(X) & ![Y: $i] : p(Y)))) <=> (~((~![X: $i] : p(X)) | (![X: $i] : p(X) & ![Y: $i] : p(Y))))),
% 0.19/0.36 inference(rewrite,[status(thm)],[])).
% 0.19/0.36 tff(6,axiom,(~(![X: $i] : p(X) => (![X: $i] : p(X) & ![Y: $i] : p(Y)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.19/0.36 tff(7,plain,
% 0.19/0.36 (~((~![X: $i] : p(X)) | (![X: $i] : p(X) & ![Y: $i] : p(Y)))),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.19/0.36 tff(8,plain,
% 0.19/0.36 (![X: $i] : p(X)),
% 0.19/0.36 inference(or_elim,[status(thm)],[7])).
% 0.19/0.36 tff(9,plain,
% 0.19/0.36 (![X: $i] : p(X)),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[8, 4])).
% 0.19/0.36 tff(10,plain,(
% 0.19/0.36 ![X: $i] : p(X)),
% 0.19/0.36 inference(skolemize,[status(sab)],[9])).
% 0.19/0.36 tff(11,plain,
% 0.19/0.36 (![X: $i] : p(X)),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[10, 3])).
% 0.19/0.36 tff(12,plain,
% 0.19/0.36 ((~![X: $i] : p(X)) | p(Y!1)),
% 0.19/0.36 inference(quant_inst,[status(thm)],[])).
% 0.19/0.36 tff(13,plain,
% 0.19/0.36 ($false),
% 0.19/0.36 inference(unit_resolution,[status(thm)],[12, 11, 1])).
% 0.19/0.36 tff(14,plain,(p(Y!1)), inference(lemma,lemma(discharge,[]))).
% 0.19/0.36 tff(15,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(16,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)],[15])).
% 0.19/0.36 tff(17,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(18,plain,
% 0.19/0.36 (~(![X: $i] : p(X) & ![Y: $i] : p(Y))),
% 0.19/0.36 inference(or_elim,[status(thm)],[7])).
% 0.19/0.36 tff(19,plain,
% 0.19/0.36 (~(![X: $i] : p(X) & ![Y: $i] : p(Y))),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[18, 16])).
% 0.19/0.36 tff(20,plain,
% 0.19/0.36 (~(![X: $i] : p(X) & ![Y: $i] : p(Y))),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[19, 17])).
% 0.19/0.36 tff(21,plain,
% 0.19/0.36 (~(![X: $i] : p(X) & ![Y: $i] : p(Y))),
% 0.19/0.36 inference(modus_ponens,[status(thm)],[20, 16])).
% 0.19/0.36 unexpected number of arguments: (let ((a!1 (forall ((X $i)) (p X))) (a!3 (forall ((Y $i)) (p Y))))
% 0.19/0.36 (let ((a!2 (sk (~ (not a!1) (not (p X!0)))))
% 0.19/0.36 (a!4 (sk (~ (not a!3) (not (p Y!1)))))
% 0.19/0.36 (a!5 (~ (not (and a!1 a!3)) (or (not (p X!0)) (not (p Y!1))))))
% 0.19/0.36 (nnf-neg a!2 a!4 a!5)))
% 0.19/0.36 Proof display could not be completed: unexpected number of arguments
% 0.19/0.36 % E exiting
%------------------------------------------------------------------------------