↑ Up

Z3---4.15.1.THM-Ass.s

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

% Computer : n004.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.11s 0.36s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SYN926+1 : TPTP v9.0.0. Released v3.1.0.
% 0.08/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n004.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Fri Jun 20 13:00:52 EDT 2025
% 0.11/0.33  % CPUTime    : 
% 0.11/0.36  % SZS status Theorem
% 0.11/0.36  % SZS output start Proof
% 0.11/0.36  tff(q_type, type, (
% 0.11/0.36     q: $i > $o)).
% 0.11/0.36  tff(p_type, type, (
% 0.11/0.36     p: $i > $o)).
% 0.11/0.36  tff(tptp_fun_X_0_type, type, (
% 0.11/0.36     tptp_fun_X_0: $i)).
% 0.11/0.36  tff(1,assumption,(![X: $i] : (~p(X))), introduced(assumption)).
% 0.11/0.36  tff(2,plain,
% 0.11/0.36      (?[X: $i] : (p(X) & q(X)) <=> ?[X: $i] : (p(X) & q(X))),
% 0.11/0.36      inference(rewrite,[status(thm)],[])).
% 0.11/0.36  tff(3,plain,
% 0.11/0.36      ((~(?[X: $i] : (p(X) & q(X)) => (?[X: $i] : p(X) & ?[X: $i] : q(X)))) <=> (~((~?[X: $i] : (p(X) & q(X))) | (?[X: $i] : p(X) & ?[X: $i] : q(X))))),
% 0.11/0.36      inference(rewrite,[status(thm)],[])).
% 0.11/0.36  tff(4,axiom,(~(?[X: $i] : (p(X) & q(X)) => (?[X: $i] : p(X) & ?[X: $i] : q(X)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.11/0.36  tff(5,plain,
% 0.11/0.36      (~((~?[X: $i] : (p(X) & q(X))) | (?[X: $i] : p(X) & ?[X: $i] : q(X)))),
% 0.11/0.36      inference(modus_ponens,[status(thm)],[4, 3])).
% 0.11/0.36  tff(6,plain,
% 0.11/0.36      (?[X: $i] : (p(X) & q(X))),
% 0.11/0.36      inference(or_elim,[status(thm)],[5])).
% 0.11/0.36  tff(7,plain,
% 0.11/0.36      (?[X: $i] : (p(X) & q(X))),
% 0.11/0.36      inference(modus_ponens,[status(thm)],[6, 2])).
% 0.11/0.36  tff(8,plain,(
% 0.11/0.36      p(X!0) & q(X!0)),
% 0.11/0.36      inference(skolemize,[status(sab)],[7])).
% 0.11/0.36  tff(9,plain,
% 0.11/0.36      (p(X!0)),
% 0.11/0.36      inference(and_elim,[status(thm)],[8])).
% 0.11/0.36  tff(10,plain,
% 0.11/0.36      ((~![X: $i] : (~p(X))) | (~p(X!0))),
% 0.11/0.36      inference(quant_inst,[status(thm)],[])).
% 0.11/0.36  tff(11,plain,
% 0.11/0.36      ($false),
% 0.11/0.36      inference(unit_resolution,[status(thm)],[10, 9, 1])).
% 0.11/0.36  tff(12,plain,(~![X: $i] : (~p(X))), inference(lemma,lemma(discharge,[]))).
% 0.11/0.36  tff(13,plain,
% 0.11/0.36      ((![X: $i] : (~p(X)) | ![X: $i] : (~q(X))) <=> (![X: $i] : (~p(X)) | ![X: $i] : (~q(X)))),
% 0.11/0.36      inference(rewrite,[status(thm)],[])).
% 0.11/0.36  tff(14,plain,
% 0.11/0.36      ((![X: $i] : (~p(X)) | ![X: $i] : (~q(X))) <=> (![X: $i] : (~p(X)) | ![X: $i] : (~q(X)))),
% 0.11/0.36      inference(rewrite,[status(thm)],[])).
% 0.11/0.36  tff(15,plain,
% 0.11/0.36      ((?[X: $i] : p(X) & ?[X: $i] : q(X)) <=> (?[X: $i] : p(X) & ?[X: $i] : q(X))),
% 0.11/0.36      inference(rewrite,[status(thm)],[])).
% 0.11/0.36  tff(16,plain,
% 0.11/0.36      ((~(?[X: $i] : p(X) & ?[X: $i] : q(X))) <=> (~(?[X: $i] : p(X) & ?[X: $i] : q(X)))),
% 0.11/0.36      inference(monotonicity,[status(thm)],[15])).
% 0.11/0.36  tff(17,plain,
% 0.11/0.36      ((~(?[X: $i] : p(X) & ?[X: $i] : q(X))) <=> (~(?[X: $i] : p(X) & ?[X: $i] : q(X)))),
% 0.11/0.36      inference(rewrite,[status(thm)],[])).
% 0.11/0.36  tff(18,plain,
% 0.11/0.36      (~(?[X: $i] : p(X) & ?[X: $i] : q(X))),
% 0.11/0.36      inference(or_elim,[status(thm)],[5])).
% 0.11/0.36  tff(19,plain,
% 0.11/0.36      (~(?[X: $i] : p(X) & ?[X: $i] : q(X))),
% 0.11/0.36      inference(modus_ponens,[status(thm)],[18, 16])).
% 0.11/0.36  tff(20,plain,
% 0.11/0.36      (~(?[X: $i] : p(X) & ?[X: $i] : q(X))),
% 0.11/0.36      inference(modus_ponens,[status(thm)],[19, 17])).
% 0.11/0.36  tff(21,plain,
% 0.11/0.36      (~(?[X: $i] : p(X) & ?[X: $i] : q(X))),
% 0.11/0.36      inference(modus_ponens,[status(thm)],[20, 16])).
% 0.11/0.36  unexpected number of arguments: (let ((a!1 (lambda ((X $i)) (refl (~ (not (p X)) (not (p X))))))
% 0.11/0.36        (a!2 (exists ((X $i)) (p X)))
% 0.11/0.36        (a!3 (forall ((X $i)) (not (p X))))
% 0.11/0.36        (a!4 (lambda ((X $i)) (refl (~ (not (q X)) (not (q X))))))
% 0.11/0.36        (a!5 (exists ((X $i)) (q X)))
% 0.11/0.36        (a!6 (forall ((X $i)) (not (q X)))))
% 0.11/0.36    (nnf-neg (nnf-neg (proof-bind a!1) (~ (not a!2) a!3))
% 0.11/0.36             (nnf-neg (proof-bind a!4) (~ (not a!5) a!6))
% 0.11/0.36             (~ (not (and a!2 a!5)) (or a!3 a!6))))
% 0.11/0.36  Proof display could not be completed: unexpected number of arguments
% 0.11/0.37  % E exiting
%------------------------------------------------------------------------------