↑ Up

Z3---4.15.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN358+1 : TPTP v9.0.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% Computer : n005.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:53 AM UTC 2025

% Result   : Theorem 0.12s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN358+1 : TPTP v9.0.0. Released v2.0.0.
% 0.07/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n005.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:31:50 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 0.12/0.37  % SZS status Theorem
% 0.12/0.37  % SZS output start Proof
% 0.12/0.37  tff(big_q_type, type, (
% 0.12/0.37     big_q: $i > $o)).
% 0.12/0.37  tff(p_type, type, (
% 0.12/0.37     p: $o)).
% 0.12/0.37  tff(tptp_fun_X_0_type, type, (
% 0.12/0.37     tptp_fun_X_0: $i)).
% 0.12/0.37  tff(tptp_fun_X_1_type, type, (
% 0.12/0.37     tptp_fun_X_1: $i)).
% 0.12/0.37  tff(1,assumption,(![X: $i] : ((~p) | (~big_q(X)))), introduced(assumption)).
% 0.12/0.37  tff(2,assumption,(big_q(X!1)), introduced(assumption)).
% 0.12/0.37  tff(3,assumption,(![X: $i] : (~big_q(X))), introduced(assumption)).
% 0.12/0.37  tff(4,plain,
% 0.12/0.37      ((~![X: $i] : (~big_q(X))) | (~big_q(X!1))),
% 0.12/0.37      inference(quant_inst,[status(thm)],[])).
% 0.12/0.37  tff(5,plain,
% 0.12/0.37      ($false),
% 0.12/0.37      inference(unit_resolution,[status(thm)],[4, 2, 3])).
% 0.12/0.37  tff(6,plain,((~![X: $i] : (~big_q(X))) | (~big_q(X!1))), inference(lemma,lemma(discharge,[]))).
% 0.12/0.37  tff(7,plain,
% 0.12/0.37      (~![X: $i] : (~big_q(X))),
% 0.12/0.37      inference(unit_resolution,[status(thm)],[6, 2])).
% 0.12/0.37  tff(8,assumption,(~p), introduced(assumption)).
% 0.12/0.37  tff(9,plain,
% 0.12/0.37      (((~p) | (~big_q(X!0))) | p),
% 0.12/0.37      inference(tautology,[status(thm)],[])).
% 0.12/0.37  tff(10,plain,
% 0.12/0.37      ((~p) | (~big_q(X!0))),
% 0.12/0.37      inference(unit_resolution,[status(thm)],[9, 8])).
% 0.12/0.37  tff(11,plain,
% 0.12/0.37      (((~p) | (~big_q(X!1))) | p),
% 0.12/0.37      inference(tautology,[status(thm)],[])).
% 0.12/0.37  tff(12,plain,
% 0.12/0.37      ((~p) | (~big_q(X!1))),
% 0.12/0.37      inference(unit_resolution,[status(thm)],[11, 8])).
% 0.12/0.37  tff(13,plain,
% 0.12/0.37      (((p & big_q(X!0)) | (p & big_q(X!1))) <=> ((~((~p) | (~big_q(X!0)))) | (~((~p) | (~big_q(X!1)))))),
% 0.12/0.37      inference(rewrite,[status(thm)],[])).
% 0.12/0.37  tff(14,plain,
% 0.12/0.37      ((((p & big_q(X!0)) | (p & big_q(X!1))) & (![X: $i] : (~(p & big_q(X))) | ((~p) | ![X: $i] : (~big_q(X))))) <=> (((p & big_q(X!0)) | (p & big_q(X!1))) & (![X: $i] : (~(p & big_q(X))) | (~p) | ![X: $i] : (~big_q(X))))),
% 0.12/0.37      inference(rewrite,[status(thm)],[])).
% 0.12/0.37  tff(15,plain,
% 0.12/0.37      ((~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))) <=> (~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X))))),
% 0.12/0.37      inference(rewrite,[status(thm)],[])).
% 0.12/0.37  tff(16,plain,
% 0.12/0.37      ((?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X))) <=> (?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))),
% 0.12/0.37      inference(rewrite,[status(thm)],[])).
% 0.12/0.37  tff(17,plain,
% 0.12/0.37      ((~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))) <=> (~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X))))),
% 0.12/0.37      inference(monotonicity,[status(thm)],[16])).
% 0.12/0.37  tff(18,plain,
% 0.12/0.37      ((~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))) <=> (~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X))))),
% 0.12/0.37      inference(transitivity,[status(thm)],[17, 15])).
% 0.12/0.37  tff(19,axiom,(~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','x2109')).
% 0.12/0.37  tff(20,plain,
% 0.12/0.37      (~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))),
% 0.12/0.37      inference(modus_ponens,[status(thm)],[19, 18])).
% 0.12/0.37  tff(21,plain,
% 0.12/0.37      (~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))),
% 0.12/0.37      inference(modus_ponens,[status(thm)],[20, 18])).
% 0.12/0.37  tff(22,plain,
% 0.12/0.37      (~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))),
% 0.12/0.37      inference(modus_ponens,[status(thm)],[21, 15])).
% 0.12/0.37  tff(23,plain,
% 0.12/0.37      (~(?[X: $i] : (p & big_q(X)) <=> (p & ?[X: $i] : big_q(X)))),
% 0.12/0.37      inference(modus_ponens,[status(thm)],[22, 18])).
% 0.12/0.37  unexpected number of arguments: (let ((a!1 (exists ((X $i)) (and p (big_q X))))
% 0.12/0.37        (a!3 (forall ((X $i)) (not (and p (big_q X)))))
% 0.12/0.37        (a!5 (exists ((X $i)) (big_q X)))
% 0.12/0.37        (a!7 (lambda ((X $i)) (refl (~ (not (big_q X)) (not (big_q X))))))
% 0.12/0.37        (a!8 (forall ((X $i)) (not (big_q X)))))
% 0.12/0.37  (let ((a!2 (sk (~ a!1 (and p (big_q X!0)))))
% 0.12/0.37        (a!4 (nnf-neg (proof-bind (lambda ((X $i))
% 0.12/0.37                                    (let ((a!1 (~ (not (and p (big_q X)))
% 0.12/0.37                                                  (not (and p (big_q X))))))
% 0.12/0.37                                      (refl a!1))))
% 0.12/0.37                      (~ (not a!1) a!3)))
% 0.12/0.37        (a!6 (monotonicity (refl (~ p p))
% 0.12/0.37                           (sk (~ a!5 (big_q X!1)))
% 0.12/0.37                           (~ (and p a!5) (and p (big_q X!1)))))
% 0.12/0.37        (a!9 (nnf-neg (refl (~ (not p) (not p)))
% 0.12/0.37                      (nnf-neg (proof-bind a!7) (~ (not a!5) a!8))
% 0.12/0.37                      (~ (not (and p a!5)) (or (not p) a!8))))
% 0.12/0.37        (a!10 (and (or (and p (big_q X!0)) (and p (big_q X!1)))
% 0.12/0.37                   (or a!3 (or (not p) a!8)))))
% 0.12/0.37  (let ((a!11 (~ (not (= a!1 (and p a!5))) a!10)))
% 0.12/0.37    (nnf-neg a!2 a!4 a!6 a!9 a!11))))
% 0.12/0.37  Proof display could not be completed: unexpected number of arguments
% 0.12/0.38  % E exiting
%------------------------------------------------------------------------------