%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SYN052+1 : TPTP v9.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n007.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:03 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.07/0.12 % Problem : SYN052+1 : TPTP v9.0.0. Released v2.0.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n007.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 12:28:20 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(big_f_type, type, (
% 0.12/0.36 big_f: $i > $o)).
% 0.12/0.36 tff(tptp_fun_X1_0_type, type, (
% 0.12/0.36 tptp_fun_X1_0: $i)).
% 0.12/0.36 tff(p_type, type, (
% 0.12/0.36 p: $o)).
% 0.12/0.36 tff(1,assumption,(~big_f(X1!0)), introduced(assumption)).
% 0.12/0.36 tff(2,plain,
% 0.12/0.36 (^[X: $i] : refl((p <=> big_f(X)) <=> (p <=> big_f(X)))),
% 0.12/0.36 inference(bind,[status(th)],[])).
% 0.12/0.36 tff(3,plain,
% 0.12/0.36 (![X: $i] : (p <=> big_f(X)) <=> ![X: $i] : (p <=> big_f(X))),
% 0.12/0.36 inference(quant_intro,[status(thm)],[2])).
% 0.12/0.36 tff(4,plain,
% 0.12/0.36 (![X: $i] : (p <=> big_f(X)) <=> ![X: $i] : (p <=> big_f(X))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(5,plain,
% 0.12/0.36 ((~(![X: $i] : (p <=> big_f(X)) => (p <=> ![X1: $i] : big_f(X1)))) <=> (~((~![X: $i] : (p <=> big_f(X))) | (p <=> ![X1: $i] : big_f(X1))))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(6,axiom,(~(![X: $i] : (p <=> big_f(X)) => (p <=> ![X1: $i] : big_f(X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pel22')).
% 0.12/0.36 tff(7,plain,
% 0.12/0.36 (~((~![X: $i] : (p <=> big_f(X))) | (p <=> ![X1: $i] : big_f(X1)))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.12/0.36 tff(8,plain,
% 0.12/0.36 (![X: $i] : (p <=> big_f(X))),
% 0.12/0.36 inference(or_elim,[status(thm)],[7])).
% 0.12/0.36 tff(9,plain,
% 0.12/0.36 (![X: $i] : (p <=> big_f(X))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[8, 4])).
% 0.12/0.36 tff(10,plain,(
% 0.12/0.36 ![X: $i] : (p <=> big_f(X))),
% 0.12/0.36 inference(skolemize,[status(sab)],[9])).
% 0.12/0.36 tff(11,plain,
% 0.12/0.36 (![X: $i] : (p <=> big_f(X))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[10, 3])).
% 0.12/0.36 tff(12,plain,
% 0.12/0.36 ((~![X: $i] : (p <=> big_f(X))) | (p <=> big_f(X1!0))),
% 0.12/0.36 inference(quant_inst,[status(thm)],[])).
% 0.12/0.36 tff(13,plain,
% 0.12/0.36 (p <=> big_f(X1!0)),
% 0.12/0.36 inference(unit_resolution,[status(thm)],[12, 11])).
% 0.12/0.36 tff(14,plain,
% 0.12/0.36 ((~(p <=> big_f(X1!0))) | (~p) | big_f(X1!0)),
% 0.12/0.36 inference(tautology,[status(thm)],[])).
% 0.12/0.36 tff(15,plain,
% 0.12/0.36 ((~(p <=> big_f(X1!0))) | (~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 | ![X1: $i] : big_f(X1)) <=> (p | ![X1: $i] : big_f(X1))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(18,plain,
% 0.12/0.36 ((p | ![X1: $i] : big_f(X1)) <=> (p | ![X1: $i] : big_f(X1))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(19,plain,
% 0.12/0.36 (((p | ![X1: $i] : big_f(X1)) & ((~p) | (~big_f(X1!0)))) <=> ((p | ![X1: $i] : big_f(X1)) & ((~p) | (~big_f(X1!0))))),
% 0.12/0.36 inference(monotonicity,[status(thm)],[18])).
% 0.12/0.36 tff(20,plain,
% 0.12/0.36 ((~(p <=> ![X1: $i] : big_f(X1))) <=> (~(p <=> ![X1: $i] : big_f(X1)))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(21,plain,
% 0.12/0.36 ((p <=> ![X1: $i] : big_f(X1)) <=> (p <=> ![X1: $i] : big_f(X1))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(22,plain,
% 0.12/0.36 ((~(p <=> ![X1: $i] : big_f(X1))) <=> (~(p <=> ![X1: $i] : big_f(X1)))),
% 0.12/0.36 inference(monotonicity,[status(thm)],[21])).
% 0.12/0.36 tff(23,plain,
% 0.12/0.36 ((~(p <=> ![X1: $i] : big_f(X1))) <=> (~(p <=> ![X1: $i] : big_f(X1)))),
% 0.12/0.36 inference(transitivity,[status(thm)],[22, 20])).
% 0.12/0.36 tff(24,plain,
% 0.12/0.36 (~(p <=> ![X1: $i] : big_f(X1))),
% 0.12/0.36 inference(or_elim,[status(thm)],[7])).
% 0.12/0.36 tff(25,plain,
% 0.12/0.36 (~(p <=> ![X1: $i] : big_f(X1))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[24, 23])).
% 0.12/0.36 tff(26,plain,
% 0.12/0.36 (~(p <=> ![X1: $i] : big_f(X1))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[25, 20])).
% 0.12/0.36 tff(27,plain,
% 0.12/0.36 (~(p <=> ![X1: $i] : big_f(X1))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[26, 23])).
% 0.12/0.36 unexpected number of arguments: (let ((a!1 (lambda ((X1 $i)) (refl (~ (big_f X1) (big_f X1)))))
% 0.12/0.36 (a!2 (forall ((X1 $i)) (big_f X1))))
% 0.12/0.36 (let ((a!3 (sk (~ (not a!2) (not (big_f X1!0)))))
% 0.12/0.36 (a!4 (and (or p a!2) (or (not p) (not (big_f X1!0))))))
% 0.12/0.36 (nnf-neg (refl (~ p p))
% 0.12/0.36 (refl (~ (not p) (not p)))
% 0.12/0.36 (nnf-pos (proof-bind a!1) (~ a!2 a!2))
% 0.12/0.36 a!3
% 0.12/0.36 (~ (not (= p a!2)) a!4))))
% 0.12/0.36 Proof display could not be completed: unexpected number of arguments
% 0.12/0.36 % E exiting
%------------------------------------------------------------------------------