↑ Up

CSI_E---1.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSI_E---1.1
% Problem  : LCL540+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar mcs_scs.jar %d %s

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:21:09 AM UTC 2026

% Result   : Theorem 0.23s 0.53s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL540+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03  % Command    : java -jar mcs_scs.jar %d %s
% 0.06/0.33  % Computer : n020.cluster.edu
% 0.06/0.33  % Model    : x86_64 x86_64
% 0.06/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.33  % Memory   : 8046.5625MB
% 0.06/0.33  % OS       : Linux 6.8.0-71-generic
% 0.06/0.33  % CPULimit   : 300
% 0.06/0.33  % WCLimit    : 300
% 0.06/0.33  % DateTime   : Fri Sep  4 16:04:27 UTC 2026
% 0.06/0.34  % CPUTime    : 
% 0.11/0.45  start to proof:theBenchmark.p
% 0.23/0.53  % Version  : CSI_E---1.1
% 0.23/0.53  % Problem  : theBenchmark.p
% 0.23/0.53  % Proof found!
% 0.23/0.53  % SZS status Theorem for theBenchmark.p
% 0.23/0.53  % SZS output start Proof
% 0.23/0.53  fof(modus_ponens, axiom, (modus_ponens<=>![X1, X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))=>is_a_theorem(X2))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', modus_ponens)).
% 0.23/0.53  fof(and_3, axiom, (and_3<=>![X1, X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', and_3)).
% 0.23/0.53  fof(hilbert_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_modus_ponens)).
% 0.23/0.53  fof(hilbert_and_3, axiom, and_3, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_and_3)).
% 0.23/0.53  fof(adjunction, axiom, (adjunction<=>![X1, X2]:((is_a_theorem(X1)&is_a_theorem(X2))=>is_a_theorem(and(X1,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', adjunction)).
% 0.23/0.53  fof(s1_0_adjunction, conjecture, adjunction, file('/export/starexec/sandbox/benchmark/theBenchmark.p', s1_0_adjunction)).
% 0.23/0.53  fof(c_0_6, plain, ![X117, X118]:((~modus_ponens|(~is_a_theorem(X117)|~is_a_theorem(implies(X117,X118))|is_a_theorem(X118)))&(((is_a_theorem(esk1_0)|modus_ponens)&(is_a_theorem(implies(esk1_0,esk2_0))|modus_ponens))&(~is_a_theorem(esk2_0)|modus_ponens))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])).
% 0.23/0.53  fof(c_0_7, plain, ![X151, X152]:((~and_3|is_a_theorem(implies(X151,implies(X152,and(X151,X152)))))&(~is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))|and_3)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])])).
% 0.23/0.53  cnf(c_0_8, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.23/0.53  cnf(c_0_9, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[hilbert_modus_ponens])).
% 0.23/0.53  cnf(c_0_10, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.23/0.53  cnf(c_0_11, plain, (and_3), inference(split_conjunct,[status(thm)],[hilbert_and_3])).
% 0.23/0.53  fof(c_0_12, plain, ![X243, X244]:((~adjunction|(~is_a_theorem(X243)|~is_a_theorem(X244)|is_a_theorem(and(X243,X244))))&(((is_a_theorem(esk59_0)|adjunction)&(is_a_theorem(esk60_0)|adjunction))&(~is_a_theorem(and(esk59_0,esk60_0))|adjunction))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[adjunction])])])])])).
% 0.23/0.53  fof(c_0_13, negated_conjecture, ~adjunction, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[s1_0_adjunction])])).
% 0.23/0.53  cnf(c_0_14, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_9])])).
% 0.23/0.53  cnf(c_0_15, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])])).
% 0.23/0.53  cnf(c_0_16, plain, (adjunction|~is_a_theorem(and(esk59_0,esk60_0))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.23/0.53  cnf(c_0_17, negated_conjecture, (~adjunction), inference(split_conjunct,[status(thm)],[c_0_13])).
% 0.23/0.53  cnf(c_0_18, plain, (is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.23/0.53  cnf(c_0_19, plain, (is_a_theorem(esk60_0)|adjunction), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.23/0.53  cnf(c_0_20, plain, (is_a_theorem(esk59_0)|adjunction), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.23/0.53  cnf(c_0_21, plain, (~is_a_theorem(and(esk59_0,esk60_0))), inference(sr,[status(thm)],[c_0_16, c_0_17])).
% 0.23/0.53  cnf(c_0_22, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_14, c_0_18])).
% 0.23/0.53  cnf(c_0_23, plain, (is_a_theorem(esk60_0)), inference(sr,[status(thm)],[c_0_19, c_0_17])).
% 0.23/0.53  cnf(c_0_24, plain, (is_a_theorem(esk59_0)), inference(sr,[status(thm)],[c_0_20, c_0_17])).
% 0.23/0.53  cnf(c_0_25, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_24])]), ['proof']).
% 0.23/0.53  % SZS output end Proof
% 0.23/0.53  % User time                : 0.047 s
% 0.23/0.53  % System time              : 0.010 s
% 0.23/0.53  % Total time               : 0.057 s
% 0.23/0.53  
%------------------------------------------------------------------------------