%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SYN399+1 : TPTP v9.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n001.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:38:59 AM UTC 2025
% Result : Theorem 0.12s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : SYN399+1 : TPTP v9.0.0. Released v2.0.0.
% 0.12/0.11 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n001.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri Jun 20 12:37:05 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.12/0.36 % SZS status Theorem
% 0.12/0.36 % SZS output start Proof
% 0.12/0.36 tff(p_type, type, (
% 0.12/0.36 p: $o)).
% 0.12/0.36 tff(f_type, type, (
% 0.12/0.36 f: $i > $o)).
% 0.12/0.36 tff(tptp_fun_Y_0_type, type, (
% 0.12/0.36 tptp_fun_Y_0: $i)).
% 0.12/0.36 tff(1,assumption,(~f(Y!0)), introduced(assumption)).
% 0.12/0.36 tff(2,plain,
% 0.12/0.36 (^[X: $i] : refl((f(X) <=> p) <=> (f(X) <=> p))),
% 0.12/0.36 inference(bind,[status(th)],[])).
% 0.12/0.36 tff(3,plain,
% 0.12/0.36 (![X: $i] : (f(X) <=> p) <=> ![X: $i] : (f(X) <=> p)),
% 0.12/0.36 inference(quant_intro,[status(thm)],[2])).
% 0.12/0.36 tff(4,plain,
% 0.12/0.36 (![X: $i] : (f(X) <=> p) <=> ![X: $i] : (f(X) <=> p)),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(5,plain,
% 0.12/0.36 ((~(![X: $i] : (f(X) <=> p) => (![Y: $i] : f(Y) <=> p))) <=> (~((~![X: $i] : (f(X) <=> p)) | (![Y: $i] : f(Y) <=> p)))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(6,axiom,(~(![X: $i] : (f(X) <=> p) => (![Y: $i] : f(Y) <=> p))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','kalish223')).
% 0.12/0.36 tff(7,plain,
% 0.12/0.36 (~((~![X: $i] : (f(X) <=> p)) | (![Y: $i] : f(Y) <=> p))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.12/0.36 tff(8,plain,
% 0.12/0.36 (![X: $i] : (f(X) <=> p)),
% 0.12/0.36 inference(or_elim,[status(thm)],[7])).
% 0.12/0.36 tff(9,plain,
% 0.12/0.36 (![X: $i] : (f(X) <=> p)),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[8, 4])).
% 0.12/0.36 tff(10,plain,(
% 0.12/0.36 ![X: $i] : (f(X) <=> p)),
% 0.12/0.36 inference(skolemize,[status(sab)],[9])).
% 0.12/0.36 tff(11,plain,
% 0.12/0.36 (![X: $i] : (f(X) <=> p)),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[10, 3])).
% 0.12/0.36 tff(12,plain,
% 0.12/0.36 ((~![X: $i] : (f(X) <=> p)) | (f(Y!0) <=> p)),
% 0.12/0.36 inference(quant_inst,[status(thm)],[])).
% 0.12/0.36 tff(13,plain,
% 0.12/0.36 (f(Y!0) <=> p),
% 0.12/0.36 inference(unit_resolution,[status(thm)],[12, 11])).
% 0.12/0.36 tff(14,plain,
% 0.12/0.36 ((~(f(Y!0) <=> p)) | f(Y!0) | (~p)),
% 0.12/0.36 inference(tautology,[status(thm)],[])).
% 0.12/0.36 tff(15,plain,
% 0.12/0.36 ((~(f(Y!0) <=> p)) | (~p)),
% 0.12/0.36 inference(unit_resolution,[status(thm)],[14, 1])).
% 0.12/0.36 tff(16,plain,
% 0.12/0.36 (~p),
% 0.12/0.36 inference(unit_resolution,[status(thm)],[15, 13])).
% 0.12/0.36 tff(17,plain,
% 0.12/0.36 ((p | ![Y: $i] : f(Y)) <=> (p | ![Y: $i] : f(Y))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(18,plain,
% 0.12/0.36 (((![Y: $i] : f(Y) | p) & ((~f(Y!0)) | (~p))) <=> ((p | ![Y: $i] : f(Y)) & ((~f(Y!0)) | (~p)))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(19,plain,
% 0.12/0.36 ((~(![Y: $i] : f(Y) <=> p)) <=> (~(![Y: $i] : f(Y) <=> p))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(20,plain,
% 0.12/0.36 ((![Y: $i] : f(Y) <=> p) <=> (![Y: $i] : f(Y) <=> p)),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(21,plain,
% 0.12/0.36 ((~(![Y: $i] : f(Y) <=> p)) <=> (~(![Y: $i] : f(Y) <=> p))),
% 0.12/0.36 inference(monotonicity,[status(thm)],[20])).
% 0.12/0.36 tff(22,plain,
% 0.12/0.36 ((~(![Y: $i] : f(Y) <=> p)) <=> (~(![Y: $i] : f(Y) <=> p))),
% 0.12/0.36 inference(transitivity,[status(thm)],[21, 19])).
% 0.12/0.36 tff(23,plain,
% 0.12/0.36 (~(![Y: $i] : f(Y) <=> p)),
% 0.12/0.36 inference(or_elim,[status(thm)],[7])).
% 0.12/0.36 tff(24,plain,
% 0.12/0.36 (~(![Y: $i] : f(Y) <=> p)),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[23, 22])).
% 0.12/0.36 tff(25,plain,
% 0.12/0.36 (~(![Y: $i] : f(Y) <=> p)),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[24, 19])).
% 0.12/0.36 tff(26,plain,
% 0.12/0.36 (~(![Y: $i] : f(Y) <=> p)),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[25, 22])).
% 0.12/0.36 unexpected number of arguments: (let ((a!1 (lambda ((Y $i)) (refl (~ (f Y) (f Y)))))
% 0.12/0.36 (a!2 (forall ((Y $i)) (f Y))))
% 0.12/0.36 (let ((a!3 (sk (~ (not a!2) (not (f Y!0)))))
% 0.12/0.36 (a!4 (and (or a!2 p) (or (not (f Y!0)) (not p)))))
% 0.12/0.36 (nnf-neg (nnf-pos (proof-bind a!1) (~ a!2 a!2))
% 0.12/0.36 a!3
% 0.12/0.36 (refl (~ p p))
% 0.12/0.36 (refl (~ (not p) (not p)))
% 0.12/0.36 (~ (not (= a!2 p)) a!4))))
% 0.12/0.36 Proof display could not be completed: unexpected number of arguments
% 0.12/0.36 % E exiting
%------------------------------------------------------------------------------