↑ Up

Z3---4.15.1.THM-Prf.s

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

% Computer : n010.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.13s 0.36s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN401+1 : TPTP v9.0.0. Released v2.0.0.
% 0.06/0.12  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n010.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Fri Jun 20 12:35:42 EDT 2025
% 0.13/0.33  % CPUTime    : 
% 0.13/0.36  % SZS status Theorem
% 0.13/0.36  % SZS output start Proof
% 0.13/0.36  tff(f_type, type, (
% 0.13/0.36     f: $i > $o)).
% 0.13/0.36  tff(tptp_fun_X_0_type, type, (
% 0.13/0.36     tptp_fun_X_0: $i)).
% 0.13/0.36  tff(1,plain,
% 0.13/0.36      (^[Y: $i] : refl(f(Y) <=> f(Y))),
% 0.13/0.36      inference(bind,[status(th)],[])).
% 0.13/0.36  tff(2,plain,
% 0.13/0.36      (![Y: $i] : f(Y) <=> ![Y: $i] : f(Y)),
% 0.13/0.36      inference(quant_intro,[status(thm)],[1])).
% 0.13/0.36  tff(3,plain,
% 0.13/0.36      (((~f(X!0)) & ![Y: $i] : f(Y)) <=> ((~f(X!0)) & ![Y: $i] : f(Y))),
% 0.13/0.36      inference(rewrite,[status(thm)],[])).
% 0.13/0.36  tff(4,plain,
% 0.13/0.36      ((~![X: $i] : (f(X) | (~![Y: $i] : f(Y)))) <=> (~![X: $i] : (f(X) | (~![Y: $i] : f(Y))))),
% 0.13/0.36      inference(rewrite,[status(thm)],[])).
% 0.13/0.36  tff(5,plain,
% 0.13/0.36      ((~![X: $i] : (![Y: $i] : f(Y) => f(X))) <=> (~![X: $i] : (f(X) | (~![Y: $i] : f(Y))))),
% 0.13/0.36      inference(rewrite,[status(thm)],[])).
% 0.13/0.36  tff(6,axiom,(~![X: $i] : (![Y: $i] : f(Y) => f(X))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','kalish229')).
% 0.13/0.36  tff(7,plain,
% 0.13/0.36      (~![X: $i] : (f(X) | (~![Y: $i] : f(Y)))),
% 0.13/0.36      inference(modus_ponens,[status(thm)],[6, 5])).
% 0.13/0.36  tff(8,plain,
% 0.13/0.36      (~![X: $i] : (f(X) | (~![Y: $i] : f(Y)))),
% 0.13/0.36      inference(modus_ponens,[status(thm)],[7, 4])).
% 0.13/0.36  tff(9,plain,
% 0.13/0.36      (~![X: $i] : (f(X) | (~![Y: $i] : f(Y)))),
% 0.13/0.36      inference(modus_ponens,[status(thm)],[8, 4])).
% 0.13/0.36  tff(10,plain,
% 0.13/0.36      (~![X: $i] : (f(X) | (~![Y: $i] : f(Y)))),
% 0.13/0.36      inference(modus_ponens,[status(thm)],[9, 4])).
% 0.13/0.36  tff(11,plain,
% 0.13/0.36      ((~f(X!0)) & ![Y: $i] : f(Y)),
% 0.13/0.36      inference(modus_ponens,[status(thm)],[10, 3])).
% 0.13/0.36  tff(12,plain,
% 0.13/0.36      (![Y: $i] : f(Y)),
% 0.13/0.36      inference(and_elim,[status(thm)],[11])).
% 0.13/0.36  tff(13,plain,
% 0.13/0.36      (![Y: $i] : f(Y)),
% 0.13/0.36      inference(modus_ponens,[status(thm)],[12, 2])).
% 0.13/0.36  tff(14,plain,
% 0.13/0.36      (~f(X!0)),
% 0.13/0.36      inference(and_elim,[status(thm)],[11])).
% 0.13/0.36  tff(15,plain,
% 0.13/0.36      ((~![Y: $i] : f(Y)) | f(X!0)),
% 0.13/0.36      inference(quant_inst,[status(thm)],[])).
% 0.13/0.36  tff(16,plain,
% 0.13/0.36      ($false),
% 0.13/0.36      inference(unit_resolution,[status(thm)],[15, 14, 13])).
% 0.13/0.36  % SZS output end Proof
% 0.13/0.36  % E exiting
%------------------------------------------------------------------------------