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