↑ Up

Z3---4.15.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN398+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:59 AM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN398+1 : TPTP v9.0.0. Released v2.0.0.
% 0.12/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:32:50 EDT 2025
% 0.12/0.33  % CPUTime    : 
% 0.19/0.37  % SZS status Theorem
% 0.19/0.37  % SZS output start Proof
% 0.19/0.37  tff(f_type, type, (
% 0.19/0.37     f: $i > $o)).
% 0.19/0.37  tff(tptp_fun_X_0_type, type, (
% 0.19/0.37     tptp_fun_X_0: $i)).
% 0.19/0.37  tff(p_type, type, (
% 0.19/0.37     p: $o)).
% 0.19/0.37  tff(tptp_fun_Y_1_type, type, (
% 0.19/0.37     tptp_fun_Y_1: $i)).
% 0.19/0.37  tff(1,assumption,(![X: $i] : (~((~p) | (~f(X))))), introduced(assumption)).
% 0.19/0.37  tff(2,plain,
% 0.19/0.37      ((~![X: $i] : (~((~p) | (~f(X))))) | (~((~p) | (~f(Y!1))))),
% 0.19/0.37      inference(quant_inst,[status(thm)],[])).
% 0.19/0.37  tff(3,plain,
% 0.19/0.37      (~((~p) | (~f(Y!1)))),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[2, 1])).
% 0.19/0.37  tff(4,plain,
% 0.19/0.37      (((~p) | (~f(Y!1))) | p),
% 0.19/0.37      inference(tautology,[status(thm)],[])).
% 0.19/0.37  tff(5,plain,
% 0.19/0.37      (p),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[4, 3])).
% 0.19/0.37  tff(6,assumption,(~f(Y!1)), introduced(assumption)).
% 0.19/0.37  tff(7,plain,
% 0.19/0.37      (((~p) | (~f(Y!1))) | f(Y!1)),
% 0.19/0.37      inference(tautology,[status(thm)],[])).
% 0.19/0.37  tff(8,plain,
% 0.19/0.37      ((~p) | (~f(Y!1))),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[7, 6])).
% 0.19/0.37  tff(9,assumption,(![Y: $i] : f(Y)), introduced(assumption)).
% 0.19/0.37  tff(10,plain,
% 0.19/0.37      ((~![Y: $i] : f(Y)) | f(Y!1)),
% 0.19/0.37      inference(quant_inst,[status(thm)],[])).
% 0.19/0.37  tff(11,plain,
% 0.19/0.37      ($false),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[10, 9, 6])).
% 0.19/0.37  tff(12,plain,((~![Y: $i] : f(Y)) | f(Y!1)), inference(lemma,lemma(discharge,[]))).
% 0.19/0.37  tff(13,plain,
% 0.19/0.37      (~![Y: $i] : f(Y)),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[12, 6])).
% 0.19/0.37  tff(14,plain,
% 0.19/0.37      (((~p) | (~![Y: $i] : f(Y))) | ![Y: $i] : f(Y)),
% 0.19/0.37      inference(tautology,[status(thm)],[])).
% 0.19/0.37  tff(15,plain,
% 0.19/0.37      ((~p) | (~![Y: $i] : f(Y))),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[14, 13])).
% 0.19/0.37  tff(16,plain,
% 0.19/0.37      (((~((~p) | (~![Y: $i] : f(Y)))) | ![X: $i] : (~((~p) | (~f(X))))) <=> ((~((~p) | (~![Y: $i] : f(Y)))) | ![X: $i] : (~((~p) | (~f(X)))))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(17,plain,
% 0.19/0.37      (((p & ![Y: $i] : f(Y)) | ![X: $i] : (p & f(X))) <=> ((~((~p) | (~![Y: $i] : f(Y)))) | ![X: $i] : (~((~p) | (~f(X)))))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(18,plain,
% 0.19/0.37      (((![X: $i] : (p & f(X)) | (p & ![Y: $i] : f(Y))) & ((~(p & f(X!0))) | ((~p) | (~f(Y!1))))) <=> (((p & ![Y: $i] : f(Y)) | ![X: $i] : (p & f(X))) & ((~(p & f(X!0))) | (~p) | (~f(Y!1))))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(19,plain,
% 0.19/0.37      ((~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))) <=> (~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y))))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(20,plain,
% 0.19/0.37      ((![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y))) <=> (![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(21,plain,
% 0.19/0.37      ((~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))) <=> (~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y))))),
% 0.19/0.37      inference(monotonicity,[status(thm)],[20])).
% 0.19/0.37  tff(22,plain,
% 0.19/0.37      ((~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))) <=> (~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y))))),
% 0.19/0.37      inference(transitivity,[status(thm)],[21, 19])).
% 0.19/0.37  tff(23,axiom,(~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','kalish215')).
% 0.19/0.37  tff(24,plain,
% 0.19/0.37      (~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[23, 22])).
% 0.19/0.37  tff(25,plain,
% 0.19/0.37      (~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[24, 22])).
% 0.19/0.37  tff(26,plain,
% 0.19/0.37      (~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[25, 19])).
% 0.19/0.37  tff(27,plain,
% 0.19/0.37      (~(![X: $i] : (p & f(X)) <=> (p & ![Y: $i] : f(Y)))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[26, 22])).
% 0.19/0.37  unexpected number of arguments: (let ((a!1 (lambda ((X $i)) (refl (~ (and p (f X)) (and p (f X))))))
% 0.19/0.37        (a!2 (forall ((X $i)) (and p (f X))))
% 0.19/0.37        (a!4 (lambda ((Y $i)) (refl (~ (f Y) (f Y)))))
% 0.19/0.37        (a!5 (forall ((Y $i)) (f Y)))
% 0.19/0.37        (a!9 (or (not (and p (f X!0))) (or (not p) (not (f Y!1))))))
% 0.19/0.37  (let ((a!3 (~ (not a!2) (not (and p (f X!0)))))
% 0.19/0.37        (a!6 (sk (~ (not a!5) (not (f Y!1)))))
% 0.19/0.37        (a!7 (~ (not (and p a!5)) (or (not p) (not (f Y!1)))))
% 0.19/0.37        (a!10 (~ (not (= a!2 (and p a!5))) (and (or a!2 (and p a!5)) a!9))))
% 0.19/0.37  (let ((a!8 (nnf-neg (refl (~ (not p) (not p))) a!6 a!7)))
% 0.19/0.37    (nnf-neg (nnf-pos (proof-bind a!1) (~ a!2 a!2))
% 0.19/0.37             (sk a!3)
% 0.19/0.37             (monotonicity (refl (~ p p))
% 0.19/0.37                           (nnf-pos (proof-bind a!4) (~ a!5 a!5))
% 0.19/0.37                           (~ (and p a!5) (and p a!5)))
% 0.19/0.37             a!8
% 0.19/0.37             a!10))))
% 0.19/0.37  Proof display could not be completed: unexpected number of arguments
% 0.19/0.37  % E exiting
%------------------------------------------------------------------------------