↑ Up

CSI_E---1.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSI_E---1.1
% Problem  : MGT003+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar mcs_scs.jar %d %s

% Computer : n031.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 : Tue Sep  8 06:04:26 AM UTC 2026

% Result   : Theorem 0.39s 0.60s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : MGT003+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.03  % Command    : java -jar mcs_scs.jar %d %s
% 0.09/0.36  % Computer : n031.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.01/0.36  % CPULimit   : 300
% 0.01/0.36  % WCLimit    : 300
% 0.01/0.36  % DateTime   : Mon Sep  7 11:37:41 UTC 2026
% 0.01/0.36  % CPUTime    : 
% 0.24/0.50  start to proof:theBenchmark.p
% 0.39/0.60  % Version  : CSI_E---1.1
% 0.39/0.60  % Problem  : theBenchmark.p
% 0.39/0.60  % Proof found!
% 0.39/0.60  % SZS status Theorem for theBenchmark.p
% 0.39/0.60  % SZS output start Proof
% 0.39/0.60  fof(t3_FOL, conjecture, ![X1, X9, X10, X2, X3]:(((((((organization(X1,X2)&organization(X1,X3))&reorganization_free(X1,X2,X3))&survival_chance(X1,X9,X2))&survival_chance(X1,X10,X3))&greater(X3,X2))=>greater(X10,X9))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', t3_FOL)).
% 0.39/0.60  fof(mp4, axiom, ![X1, X2, X3]:((reorganization_free(X1,X2,X3)=>(reorganization_free(X1,X2,X2)&reorganization_free(X1,X3,X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mp4)).
% 0.39/0.60  fof(t1_FOL, hypothesis, ![X1, X6, X2, X3, X7, X8, X9, X10]:((((((((((organization(X1,X2)&organization(X6,X3))&reorganization_free(X1,X2,X2))&reorganization_free(X6,X3,X3))&inertia(X1,X7,X2))&inertia(X6,X8,X3))&survival_chance(X1,X9,X2))&survival_chance(X6,X10,X3))&greater(X8,X7))=>greater(X10,X9))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', t1_FOL)).
% 0.39/0.60  fof(t2_FOL, hypothesis, ![X1, X7, X8, X2, X3]:(((((((organization(X1,X2)&organization(X1,X3))&reorganization_free(X1,X2,X3))&inertia(X1,X7,X2))&inertia(X1,X8,X3))&greater(X3,X2))=>greater(X8,X7))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', t2_FOL)).
% 0.39/0.60  fof(mp5, axiom, ![X1, X4]:((organization(X1,X4)=>?[X5]:(inertia(X1,X5,X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mp5)).
% 0.39/0.60  fof(c_0_5, negated_conjecture, ~(![X1, X9, X10, X2, X3]:(((((((organization(X1,X2)&organization(X1,X3))&reorganization_free(X1,X2,X3))&survival_chance(X1,X9,X2))&survival_chance(X1,X10,X3))&greater(X3,X2))=>greater(X10,X9)))), inference(assume_negation,[status(cth)],[t3_FOL])).
% 0.39/0.60  fof(c_0_6, plain, ![X32, X33, X34]:(((reorganization_free(X32,X33,X33)|~reorganization_free(X32,X33,X34))&(reorganization_free(X32,X34,X34)|~reorganization_free(X32,X33,X34)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp4])])])])).
% 0.39/0.60  fof(c_0_7, negated_conjecture, ((((((organization(esk1_0,esk4_0)&organization(esk1_0,esk5_0))&reorganization_free(esk1_0,esk4_0,esk5_0))&survival_chance(esk1_0,esk2_0,esk4_0))&survival_chance(esk1_0,esk3_0,esk5_0))&greater(esk5_0,esk4_0))&~greater(esk3_0,esk2_0)), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
% 0.39/0.60  fof(c_0_8, hypothesis, ![X11, X12, X13, X14, X15, X16, X17, X18]:((~organization(X11,X13)|~organization(X12,X14)|~reorganization_free(X11,X13,X13)|~reorganization_free(X12,X14,X14)|~inertia(X11,X15,X13)|~inertia(X12,X16,X14)|~survival_chance(X11,X17,X13)|~survival_chance(X12,X18,X14)|~greater(X16,X15)|greater(X18,X17))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_FOL])])])).
% 0.39/0.60  cnf(c_0_9, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X3,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.39/0.60  cnf(c_0_10, negated_conjecture, (reorganization_free(esk1_0,esk4_0,esk5_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.39/0.60  fof(c_0_11, hypothesis, ![X19, X20, X21, X22, X23]:((~organization(X19,X22)|~organization(X19,X23)|~reorganization_free(X19,X22,X23)|~inertia(X19,X20,X22)|~inertia(X19,X21,X23)|~greater(X23,X22)|greater(X21,X20))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])])])).
% 0.39/0.60  fof(c_0_12, plain, ![X29, X30]:((~organization(X29,X30)|inertia(X29,esk6_2(X29,X30),X30))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])])).
% 0.39/0.60  cnf(c_0_13, hypothesis, (greater(X8,X7)|~organization(X1,X2)|~organization(X3,X4)|~reorganization_free(X1,X2,X2)|~reorganization_free(X3,X4,X4)|~inertia(X1,X5,X2)|~inertia(X3,X6,X4)|~survival_chance(X1,X7,X2)|~survival_chance(X3,X8,X4)|~greater(X6,X5)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.39/0.60  cnf(c_0_14, negated_conjecture, (survival_chance(esk1_0,esk3_0,esk5_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.39/0.60  cnf(c_0_15, negated_conjecture, (organization(esk1_0,esk5_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.39/0.60  cnf(c_0_16, negated_conjecture, (reorganization_free(esk1_0,esk5_0,esk5_0)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.39/0.60  cnf(c_0_17, hypothesis, (greater(X5,X4)|~organization(X1,X2)|~organization(X1,X3)|~reorganization_free(X1,X2,X3)|~inertia(X1,X4,X2)|~inertia(X1,X5,X3)|~greater(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.39/0.60  cnf(c_0_18, plain, (inertia(X1,esk6_2(X1,X2),X2)|~organization(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.39/0.60  cnf(c_0_19, negated_conjecture, (greater(esk3_0,X1)|~greater(X2,X3)|~survival_chance(X4,X1,X5)|~inertia(esk1_0,X2,esk5_0)|~inertia(X4,X3,X5)|~organization(X4,X5)|~reorganization_free(X4,X5,X5)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15]), c_0_16])])).
% 0.39/0.60  cnf(c_0_20, hypothesis, (greater(esk6_2(X1,X2),X3)|~greater(X2,X4)|~inertia(X1,X3,X4)|~organization(X1,X2)|~organization(X1,X4)|~reorganization_free(X1,X4,X2)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.39/0.60  cnf(c_0_21, negated_conjecture, (greater(esk3_0,X1)|~greater(esk6_2(esk1_0,esk5_0),X2)|~survival_chance(X3,X1,X4)|~inertia(X3,X2,X4)|~organization(X3,X4)|~reorganization_free(X3,X4,X4)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_18]), c_0_15])])).
% 0.39/0.60  cnf(c_0_22, hypothesis, (greater(esk6_2(X1,X2),esk6_2(X1,X3))|~greater(X2,X3)|~organization(X1,X2)|~organization(X1,X3)|~reorganization_free(X1,X3,X2)), inference(spm,[status(thm)],[c_0_20, c_0_18])).
% 0.39/0.60  cnf(c_0_23, hypothesis, (greater(esk3_0,X1)|~greater(esk5_0,X2)|~survival_chance(X3,X1,X4)|~inertia(X3,esk6_2(esk1_0,X2),X4)|~organization(esk1_0,X2)|~organization(X3,X4)|~reorganization_free(esk1_0,X2,esk5_0)|~reorganization_free(X3,X4,X4)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_15])])).
% 0.39/0.60  cnf(c_0_24, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.39/0.60  cnf(c_0_25, hypothesis, (greater(esk3_0,X1)|~greater(esk5_0,X2)|~survival_chance(esk1_0,X1,X2)|~organization(esk1_0,X2)|~reorganization_free(esk1_0,X2,esk5_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_18]), c_0_24])).
% 0.39/0.60  cnf(c_0_26, negated_conjecture, (survival_chance(esk1_0,esk2_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.39/0.60  cnf(c_0_27, negated_conjecture, (greater(esk5_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.39/0.60  cnf(c_0_28, negated_conjecture, (organization(esk1_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.39/0.60  cnf(c_0_29, negated_conjecture, (~greater(esk3_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.39/0.60  cnf(c_0_30, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), c_0_28]), c_0_10])]), c_0_29]), ['proof']).
% 0.39/0.60  % SZS output end Proof
% 0.39/0.60  % User time                : 0.009 s
% 0.39/0.60  % System time              : 0.003 s
% 0.39/0.60  % Total time               : 0.011 s
% 0.39/0.60  % User time                : 0.009 s
% 0.39/0.60  % System time              : 0.008 s
% 0.39/0.60  % Total time               : 0.016 s
% 0.39/0.60  
%------------------------------------------------------------------------------